Filters








53,336 Hits in 14.4 sec

Optimizing Symbolic Model Checking for Constraint-Rich Models [chapter]

Bwolen Yang, Reid Simmons, Randal E. Bryant, David R. O'Hallaron
1999 Lecture Notes in Computer Science  
This paper presents optimizations for verifying systems with complex timeinvariant constraints.  ...  We show that these two optimizations are essential in verifying constraint-rich problems; in particular, this work has enabled the verification of fault diagnosis models of the Nomad robot (an Antarctic  ...  Acknowledgement We thank Ken McMillan for discussions on the effects of macro expansion. We thank Olivier Coudert, Fabio Somenzi and reviewers for comments on this work.  ... 
doi:10.1007/3-540-48683-6_29 fatcat:nq5sb7y3zvedtd7dap5waqwtuu

Optimizing Symbolic Model Checking for Constraint-Rich Models

Bwolen Yang, Reid Simmons, Randal E. Bryant, David R. O'Hallaron
2018
This paper presents optimizations for verifying systems with complex time-invariant constraints.  ...  We show that these two optimizations are essential in verifying constraint-rich problems; in particular, this work has enabled the verification of fault diagnosis models of the Nomad robot (an Antarctic  ...  Acknowledgement We thank Ken McMillan for discussions on the effects of macro expansion. We thank Olivier Coudert, Fabio Somenzi and reviewers for comments on this work.  ... 
doi:10.1184/r1/6608210 fatcat:ugavcin7zrbqlf3lg24226evs4

Symbolic Model-Checking Using ITS-Tools [chapter]

Yann Thierry-Mieg
2015 Lecture Notes in Computer Science  
We present verification toolset ITS-tools, featuring a symbolic modelchecking back-end engine based on hierarchical set decision diagrams (SDD) that supports reachability, CTL and LTL model-checking and  ...  Using model transformations to a Guarded Action Language (GAL) as intermediate format, ITS-tools can analyze third party (Uppaal, Spin, Divine...) specifications.  ...  LT L \ X) we also offer optimized hybrid [23] and fully symbolic [7] algorithms that exploit saturation.  ... 
doi:10.1007/978-3-662-46681-0_20 fatcat:wuraebux5rguvm5k2gxdb2zpg4

The Challenge of Generating Spatially Balanced Scientific Experiment Designs [chapter]

Carla Gomes, Meinolf Sellmann, Cindy van Es, Harold van Es
2004 Lecture Notes in Computer Science  
From the perspective of the Constraint Programing (CP), Artificial Intelligence (AI), and Operations Research (OR) communities, combinatorial design problems are interesting since they possess rich structural  ...  A Latin square on n symbols is an n × n matrix (n is the order of the Latin square), in which each symbol occurs precisely once in each row and in each column.  ...  We also keep a dual model in form of the row conjugate that is connected to the primal model via channeling constraints for the quasi-group completion problem [10, 12] .  ... 
doi:10.1007/978-3-540-24664-0_28 fatcat:rxg3y5ec3ndybkh5t4cnb5oivq

Scalable Design Space Exploration via Answer Set Programming

Philipp Wanko, Marc Herbstritt
2016 International Conference on Logic Programming  
ideas for multi-objective combinatorial optimization.  ...  Recently, advances in Boolean constraint solvers for Answer Set Programming (ASP) allow for easy integration of background theories and more control over the solving process.  ...  As such, it combines a rich yet simple modeling language with advanced Boolean constraint technology.  ... 
doi:10.4230/oasics.iclp.2016.23 dblp:conf/iclp/Wanko16 fatcat:6x6v7vyd6ncwpkfvt5f5nuixgi

Verification of C++ Flight Software with the MCP Model Checker

S. Thompson, G. Brat
2008 IEEE Aerospace Conference. Proceedings  
Our tools will range from a static analyzer (based on abstract interpretation like C Global Surveyor) to a model checker (MCP, which we present in this paper) including a symbolic execution engine for  ...  The verification of these C++ flight codes is critical, especially for Orion, since human life will be at stake. There exist some commercial tools for the verification of C++ code.  ...  Figure 3 . 3 Driver for model checking OAE.  ... 
doi:10.1109/aero.2008.4526577 fatcat:i54z3xccznanzkui3ystzqahza

p4pktgen

Andres Nötzli, Jehandad Khan, Andy Fingerhut, Clark Barrett, Peter Athanas
2018 Proceedings of the Symposium on SDN Research - SOSR '18  
In this work, we present p4pktgen, a tool for automatically generating test cases for P4 programs using symbolic execution.  ...  Programming languages such as P4 lower the barrier for changing the inner workings of network switches and offer a uniform experience across different devices.  ...  We thank Fraser Brown and Christopher Aberger for their valuable feedback. We thank Colin Burgin for his help with the implementation.  ... 
doi:10.1145/3185467.3185497 dblp:conf/sosr/NotzliKFBA18 fatcat:xdyrt2fqu5hn7lw4gprmnq733i

Practical Verification of Hierarchical Artifact Systems

Yuliang Li
2017 Very Large Data Bases Conference  
Artifact System (HAS) model presented in [9] .  ...  Data-driven workflows, of which IBM's Business Artifacts are a prime exponent, have been successfully deployed in practice, adopted in industrial standards, and have spawned a rich body of research in  ...  The GSM approach provides rich structuring mechanisms for services, including parallelism, concurrency and hierarchy, and has been incorporated in the OMG standard for Case Management Model and Notation  ... 
dblp:conf/vldb/Li17 fatcat:m4i5l5eqrjaetc6tlb7ypcqru4

Model Checking VHDL with CV [chapter]

David Déharbe, Subash Shankar, Edmund M. Clarke
1998 Lecture Notes in Computer Science  
This article describes a prototype implementation of a symbolic model checker for a subset of VHDL.  ...  The model checker applies a number of techniques to reduce the search space, thus allowing for efficient verification of real circuits.  ...  The verification system uses symbolic model checking. Our approach allows for a number of optimizations that result in dramatically smaller state spaces.  ... 
doi:10.1007/3-540-49519-3_33 fatcat:h6da2poqp5f3bgo4bdpzdpu4da

Page 494 of Mathematical Reviews Vol. , Issue 99a [page]

1991 Mathematical Reviews  
model-checking methods for real-time systems (222-242).  ...  Schek, Unified transaction model for semanti- cally rich operations (148-161); Yoav Raz, The dynamic two phase commitment (D2PC) protocol (162-176); Dan Suciu, Domain- independent queries on databases  ... 

UPPAAL - Now, Next, and Future [chapter]

Tobias Amnell, Gerd Behrmann, Johan Bengtsson, Pedro R. D'Argenio, Alexandre David, Ansgar Fehnker, Thomas Hune, Bertrand Jeannet, Kim G. Larsen, M. Oliver Möller, Paul Pettersson, Carsten Weise (+1 others)
2001 Lecture Notes in Computer Science  
We report on new directions that extends Uppaal with cost-optimal exploration, parametric modeling, stop-watches, probablistic modeling, hierachical modeling, executable timed automata, and a hybrid automata  ...  Uppaal is a tool for modeling, simulation and verification of real-time systems, developed jointly by BRICS at Aalborg University and the Department of Computer Systems at Uppsala University.  ...  An open mailing list at http://groups.yahoo.com/group/uppaal serves as a lively discussion forum for both Uppaal users and developers.  ... 
doi:10.1007/3-540-45510-8_4 fatcat:gkjichcicnhgbmefmf7oavkd5i

A Survey of Symbolic Execution Techniques [article]

Roberto Baldoni, Emilio Coppa, Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi
2018 arXiv   pre-print
Many security and software testing applications require checking whether certain properties of a program hold for any possible usage scenario.  ...  Rather than taking on fully specified input values, the technique abstractly represents them as symbols, resorting to constraint solvers to construct actual instances that would cause property violations  ...  constraint independence optimization.  ... 
arXiv:1610.00502v3 fatcat:zez6xtyiuna6rgv7ola3nzxmty

Making the Right Cut in Model Checking Data-Intensive Timed Systems [chapter]

Rüdiger Ehlers, Michael Gerke, Hans-Jörg Peter
2010 Lecture Notes in Computer Science  
Additionally, our framework allows to employ existing highly-optimized implementations for DBMs and BDDs without modifications.  ...  The success of industrial-scale model checkers such as Uppaal [3] or NuSMV [12] relies on the efficiency of their respective symbolic state space representations.  ...  For keeping track of the timing correctly, a rich theory of timed automata [1] has been developed, which forms the theoretical foundation for model checking tools such as Uppaal [3] , Kronos [23] ,  ... 
doi:10.1007/978-3-642-16901-4_37 fatcat:m64gkdflrfbetjjbi4ifdzfr4u

A Survey of Symbolic Execution Techniques

Roberto Baldoni, Emilio Coppa, Daniele Cono D'elia, Camil Demetrescu, Irene Finocchi
2018 ACM Computing Surveys  
Many security and software testing applications require checking whether certain properties of a program hold for any possible usage scenario.  ...  Rather than taking on fully specified input values, the technique abstractly represents them as symbols, resorting to constraint solvers to construct actual instances that would cause property violations  ...  constraint independence optimization.  ... 
doi:10.1145/3182657 fatcat:h6kadibzkvevxa3lgzdtdokq74

SpinArt: A Spin-based Verifier for Artifact Systems [article]

Yuliang Li, Alin Deutsch, Victor Vianu
2018 arXiv   pre-print
In previous work, we obtained theoretical results on the verification of a rich model incorporating core elements of IBM's successful Guard-Stage-Milestone (GSM) artifact model.  ...  Following up on these results, the present paper reports on the implementation of SpinArt, a practical verifier based on the classical model-checking tool Spin.  ...  With the symbolic representation, the verification of TAS's is reduced to finite-state model checking that Spin can handle.  ... 
arXiv:1705.09427v3 fatcat:7h3ayhvyefcbbefj3obmw7ecei
« Previous Showing results 1 — 15 out of 53,336 results