Model checking and code generation for transaction processing software

Mentis, Anakreon; Katsaros, Panagiotis

doi:10.1002/cpe.1876

Cited by 6 publications

(4 citation statements)

References 19 publications

(42 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In contrast to these papers, which focus on data non-determinism for a single thread of the application server, we focus on concurrent interactions of multiple server threads with the database. We assume correctness of DBMS implementation; orthogonal research looks for bugs in databases and transaction models [9,19].…”

Section: Related Workmentioning

confidence: 99%

Model Checking Database Applications

Gligoric

Majumdar

2013

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

We describe the design of DPF, an explicit-state model checker for database-backed web applications. DPF interposes between the program and the database layer, and precisely tracks the effects of queries made to the database. We experimentally explore several implementation choices for the model checker: stateful vs. stateless search, state storage and backtracking strategies, and dynamic partial-order reduction. In particular, we define independence relations at different granularity levels of the database (at the database, relation, record, attribute, or cell level), and show the effectiveness of dynamic partial-order reduction based on these relations.We apply DPF to look for atomicity violations in web applications. Web applications maintain shared state in databases, and typically there are relatively few database accesses for each request. This implies concurrent interactions are limited to relatively few and well-defined points, enabling our model checker to scale. We explore the performance implications of various design choices and demonstrate the effectiveness of DPF on a set of Java benchmarks. Our model checker was able to find new concurrency bugs in two open-source web applications, including in a standard example distributed with the Spring framework.

show abstract

Section: Related Workmentioning

confidence: 99%

Model Checking Database Applications

Gligoric

Majumdar

2013

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

show abstract

“…MC can be applied during the early stages of the development cycle, allowing one to analyze even partial specifications, in such a way that it is not necessary to completely describe a system before information can be obtained regarding its correctness. MC has been applied in a variety of practical scenarios, including, for instance, communication and security protocols [2,3], embedded reactive systems [18], computer device drivers [57], database-backed web applications [24], concurrency control and transaction atomicity [35], automated verification of UML design of applications [20], testing of railway control systems [5,44], and verification of clinical guidelines [22].…”

Section: Introductionmentioning

confidence: 99%

Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy

Bozzelli¹,

Molinari²,

Montanari³

et al. 2018

Information and Computation

View full text Add to dashboard Cite

Some temporal properties of reactive systems, such as actions with duration, accomplishments, and temporal aggregations, which are inherently interval-based, can not be properly dealt with by the standard, point-based temporal logics LTL, CTL and CTL*, as they give a state-by-state account of system evolution. Conversely, interval temporal logics-which feature intervals, instead of points, as their primitive entities-are highly expressive formalisms for temporal representation and reasoning that naturally allow one to deal with them. In this paper, we study the model checking (MC) problem for Halpern and Shoham's modal logic of time intervals (HS), interpreted on Kripke structures, under the homogeneity assumption, according to which a proposition letter holds over a finite computation path (interval) if and only if it holds at all of its states. HS is the best known interval-based temporal logic, which has one modality for each of the 13 possible ordering relations between pairs of intervals (the so-called Allen's relations), apart from equality. We focus on the MC problem for some HS fragments featuring modalities for (a subset of) Allen's relations meet, met-by, started-by, and finished-by, showing that it is in P NP , a class to which other pointbased logics (e.g., CTL+ and FCTL) are known to belong. Additionally, we provide some complexity lower bounds to the problem. All the algorithms we propose can be efficiently implemented by means of a polynomial-time procedure which iteratively invokes a SATsolver, enabling us to directly exploit the great speed of SAT-solvers.

show abstract

“…The first category includes a survey on hardware‐aware and heterogeneous computing on multicore processors and accelerators and a contribution on trends and challenges in operating systems . The performance category proposes challenging topics such as reliability bottlenecks in integrated parallel fault‐tolerant systems , input/output in web servers , and model checking and code generation for transaction processing software . Finally, HPC for eScience presents an application to life sciences simulations based on parallel stochastic simulations with rigorous distribution of pseudo‐random numbers and a fast seismic modeling and reverse time migration on a graphics processing unit (GPU) cluster .…”

mentioning

confidence: 99%

“…In , Mentis and Katsaros present a model‐driven approach for generating a provably correct implementation of the transaction model of interest. The model is specified by state machines that represent the transaction participants who are synchronized on a set of events.…”

mentioning

confidence: 99%