SMT-based Verification of LTL Specification with Integer Constraints and its Application to Runtime Checking of Service Substitutability

Bersani, Marcello M.; Cavallaro, Luca; Frigeri, Achille; Pradella, Matteo; Rossi, Matteo

doi:10.1109/sefm.2010.37

Cited by 14 publications

(15 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, our oracles cannot verify whether the payment is the sum of the items the user added into the cart at some point in the past. There are works that extend LTL with constraints on integer numbers [10], and they could be used by our oracle for checking more fine-grained properties.…”

Section: Limitationsmentioning

confidence: 99%

Toward Black-Box Detection of Logic Flaws in Web Applications

Pellegrino

Balzarotti

2014

Proceedings 2014 Network and Distributed System Security Symposium

View full text Add to dashboard Cite

Abstract-Web applications play a very important role in many critical areas, including online banking, health care, and personal communication. This, combined with the limited security training of many web developers, makes web applications one of the most common targets for attackers.In the past, researchers have proposed a large number of white-and black-box techniques to test web applications for the presence of several classes of vulnerabilities. However, traditional approaches focus mostly on the detection of input validation flaws, such as SQL injection and cross-site scripting. Unfortunately, logic vulnerabilities specific to particular applications remain outside the scope of most of the existing tools and still need to be discovered by manual inspection.In this paper we propose a novel black-box technique to detect logic vulnerabilities in web applications. Our approach is based on the automatic identification of a number of behavioral patterns starting from few network traces in which users interact with a certain application. Based on the extracted model, we then generate targeted test cases following a number of common attack scenarios.We applied our prototype to seven real world E-commerce web applications, discovering ten very severe and previouslyunknown logic vulnerabilities.

show abstract

Section: Limitationsmentioning

confidence: 99%

Toward Black-Box Detection of Logic Flaws in Web Applications

Pellegrino

Balzarotti

2014

Proceedings 2014 Network and Distributed System Security Symposium

View full text Add to dashboard Cite

show abstract

“…However, this calculation is computationally expensive as it requires covering all the trace set. In order to eliminate execution errors (e.g., deadlocks) efficiently, model checking can be used in the generation of mediators [8,19,37].…”

Section: The Protocol Perspective: Synthesising Protocol Mediatorsmentioning

confidence: 99%

Composing Distributed Systems: Overcoming the Interoperability Challenge

Issarny

Bennaceur

2013

Formal Methods for Components and Objects

View full text Add to dashboard Cite

Abstract. Software systems are increasingly composed of independentlydeveloped components, which are often systems by their own. This composition is possible only if the components are interoperable, i.e., are able to work together in order to achieve some user task(s). However, interoperability is often hampered by the differences in the data types, communication protocols, and middleware technologies used by the components involved. In order to enable components to interoperate despite these differences, mediators that perform the necessary data translations and coordinate the components' behaviours appropriately, have been introduced. Still, interoperability remains a critical challenge for today's and even more tomorrow's distributed systems that are highly heterogeneous and dynamic. This chapter introduces the fundamental principles and solutions underlaying interoperability in software systems with a special focus on protocols. First, we take a software architecture perspective and present the fundamentals for reasoning about interoperability and bring out mediators as a key solution to achieve protocol interoperability. Then, we review the solutions proposed for the implementation, synthesis, and dynamic deployment of mediators. We show how these solutions still fall short in automatically solving the interoperability problem in the context of systems of systems. This leads us to present the solution elaborated in the context of the European Connect project, which revolves around the notion of emergent middleware, whereby mediators are synthesised on the fly. We consider the GMES (Global Monitoring of Environment and Security) initiative and use it to illustrate the different solutions presented.

show abstract

“…4 The implementation, in Scala, is in a prototypical stage and is intended as a testbed for rapidly trying out ideas. As the first-order logic theorem prover for the Close rule we coupled Microsoft's SMT-solver Z3 [14].…”

Section: Implementation and Experimentsmentioning

confidence: 99%

“…Bersani et al [4] describe linking SMT-solvers to decide bounded model checking problems over temporal logic extensions. There, LTL with integer constraints is considered, which results in an undecidable satisfiability problem.…”

Section: Introductionmentioning

confidence: 99%

Tableaux for Verification of Data-Centric Processes

Bauer

Baumgartner

Diller

et al. 2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Current approaches to analyzing dynamic systems are mostly grounded in propositional (temporal) logics. As a consequence, they often lack expressivity for modelling rich data structures and reasoning about them in the course of a computation. To address this problem, we propose a rich modelling framework based on first-order logic over background theories (arithmetics, lists, records, etc) and state transition systems over corresponding interpretations. On the reasoning side, we introduce a tableau calculus for bounded model checking of properties expressed in a certain fragment of CTL* over that first-order logic. We also describe a k-induction scheme on top of that calculus for proving safety properties, and we report on first experiments with a prototypical implementation.

show abstract

SMT-based Verification of LTL Specification with Integer Constraints and its Application to Runtime Checking of Service Substitutability

Cited by 14 publications

References 23 publications

Toward Black-Box Detection of Logic Flaws in Web Applications

Toward Black-Box Detection of Logic Flaws in Web Applications

Composing Distributed Systems: Overcoming the Interoperability Challenge

Tableaux for Verification of Data-Centric Processes

Contact Info

Product

Resources

About