Filters








80,266 Hits in 4.1 sec

A Symbolic Semantics for Abstract Model Checking [chapter]

Francesca Levi
1998 Lecture Notes in Computer Science  
We present a finite symbolic semantics of value-passing concurrent processes, that can be suitably interpreted over abstract values to compute a lower approximate semantics of full µ-calculus.  ...  The relations of non-deterministic and alternative choices turn out to be very useful for the dual approximations of the existential next modality.  ...  Section 6 presents abstract model checking and Sect. 7 discuss optimality of abstract model checking. Concrete Model Checking We consider a value-passing version of CCS.  ... 
doi:10.1007/3-540-49727-7_8 fatcat:zf43px7muza2dbyormuphis3tm

A symbolic semantics for abstract model checking

Francesca Levi
2001 Science of Computer Programming  
The obtained symbolic graph is ÿnite for regular processes and can suitably be interpreted over abstract values to e ectively compute a safe abstract model for full -calculus model checking.  ...  In this paper we present a symbolic semantics of value-passing concurrent processes where classical branching is replaced by separate relations of non-deterministic branch and alternative choice.  ...  Acknowledgements I would like to thank Radhia and Patrick Cousot for having me introduced to the abstract interpretation theory.  ... 
doi:10.1016/s0167-6423(00)00015-0 fatcat:wrxa2fufpfhuxp7ahsun6bpy5u

CELL: A Compositional Verification Framework [chapter]

Kun Ji, Yang Liu, Shang-Wei Lin, Jun Sun, Jin Song Dong, Truong Khanh Nguyen
2013 Lecture Notes in Computer Science  
This paper presents CELL, a comprehensive and extensible framework for compositional verification of concurrent and real-time systems based on commonly used semantic models.  ...  For each semantic model, CELL offers three libraries, i.e., compositional verification paradigms, learning algorithms and model checking methods to support various state-of-the-art compositional verification  ...  We provide explicit-state model checking and symbolic model checking for LTS, and zone-based model checking for TTS.  ... 
doi:10.1007/978-3-319-02444-8_38 fatcat:wzzt6aawo5en5ihb24rslt7bkq

PAT 3: An Extensible Architecture for Building Multi-domain Model Checkers

Yang Liu, Jun Sun, Jin Song Dong
2011 2011 IEEE 22nd International Symposium on Software Reliability Engineering  
IRL contains several common semantic models to support wide application domains, and builds both explicit model checking and symbolic model checking under one roof.  ...  Although it is desirable to have a dedicated model checker for each application domain, implementing one is rather challenging.  ...  For symbolic model checking, different operations are defined so that a symbolic representation is generated to capture the language semantics, usually in the form of Boolean formulae.  ... 
doi:10.1109/issre.2011.19 dblp:conf/issre/LiuSD11 fatcat:mzvncchodjfb5jalag7u7kfufa

Impartial Anticipation in Runtime-Verification [chapter]

Wei Dong, Martin Leucker, Christian Schallhart
2008 Lecture Notes in Computer Science  
Therefore, a generic three-valued semantics is introduced reflecting the idea that prefixes of infinite computations are checked.  ...  In this paper, a uniform approach for synthesizing monitors checking correctness properties specified in linear-time logics at runtime is provided.  ...  Model checking, though, is often reduced to constructing the automaton A ¬φ accepting the counter examples of φ and checking the intersection of a model and A ¬φ for emptiness.  ... 
doi:10.1007/978-3-540-88387-6_33 fatcat:sy6rumuuzngcbnm7me5rxru4zi

Build your own model checker in one month

Jin Song Dong, Jun Sun, Yang Liu
2013 2013 35th International Conference on Software Engineering (ICSE)  
It has an extensible and modularized architecture to support new languages (and their operational semantics), new state reduction or abstraction techniques, new model checking algorithms, etc.  ...  In this tutorial, we will briefly survey a variety of model checking techniques.  ...  For the symbolic model checking approach, symbolic verification algorithms [12] , [11] , [10] are developed for the generated BDD encoding of the system.  ... 
doi:10.1109/icse.2013.6606751 dblp:conf/icse/DongSL04 fatcat:nbflxs4zmndjrigttljqze5s2a

Higher-order symbolic execution via contracts

Sam Tobin-Hochstadt, David Van Horn
2012 Proceedings of the ACM international conference on Object oriented programming systems languages and applications - OOPSLA '12  
The result is a executable semantics that soundly predicts program behavior, including contract failures, for all possible instantiations of symbolic components.  ...  Our approach is based on the idea of an abstract reduction semantics that gives an operational semantics to programs with both concrete and symbolic components.  ...  Dimoulas for discussions and advice.  ... 
doi:10.1145/2384616.2384655 dblp:conf/oopsla/Tobin-HochstadtH12 fatcat:q76ikttfhzgr7kt6gi36myqrnu

Higher-order symbolic execution via contracts

Sam Tobin-Hochstadt, David Van Horn
2012 SIGPLAN notices  
The result is a executable semantics that soundly predicts program behavior, including contract failures, for all possible instantiations of symbolic components.  ...  Our approach is based on the idea of an abstract reduction semantics that gives an operational semantics to programs with both concrete and symbolic components.  ...  Dimoulas for discussions and advice.  ... 
doi:10.1145/2398857.2384655 fatcat:yvyqxycx7bh75pfavpzubwqff4

Explaining Symbolic Trajectory Evaluation by Giving It a Faithful Semantics [chapter]

Jan-Willem Roorda, Koen Claessen
2006 Lecture Notes in Computer Science  
Symbolic Trajectory Evaluation (STE) is a formal verification technique for hardware.  ...  In this paper, we present a new closure semantics for STE which does match the proving power of STE model-checkers, and makes STE easier to understand.  ...  Acknowledgements Thanks to Mary Sheeran for commenting on earlier drafts of this paper. Thanks to Tom Melham for contributing to the discussions on the semantics of STE.  ... 
doi:10.1007/11753728_56 fatcat:yghox4uutba67gxm2l727v4way

Higher-Order Symbolic Execution via Contracts [article]

Sam Tobin-Hochstadt, David Van Horn
2012 arXiv   pre-print
The result is a executable semantics that soundly predicts program behavior, including contract failures, for all possible instantiations of symbolic components.  ...  Our approach is based on the idea of an abstract reduction semantics that gives an operational semantics to programs with both concrete and symbolic components.  ...  Dimoulas for discussions and advice.  ... 
arXiv:1103.1362v4 fatcat:djr7xj3ozbggvfu74a7qkdq6qu

Translating Software Designs for Model Checking [chapter]

Fei Xie, Vladimir Levin, Robert P. Kurshan, James C. Browne
2004 Lecture Notes in Computer Science  
These issues are considered under the framework of integrated model/property translation and include: (1) translator architecture; (2) semantics translation from a software language to a formal language  ...  This paper presents a systematic consideration of the major issues involved in translation of executable design level software specification languages to directly model-checkable formal languages.  ...  Application of symbolic model checking to an S/R model translated from an xUML model transformed by SPOR enables integrated application of POR and symbolic model checking.  ... 
doi:10.1007/978-3-540-24721-0_24 fatcat:ovwkw74ox5fadpdf5sbgmehbra

A Faithful Semantics for Generalised Symbolic Trajectory Evaluation

Koen Claessen, Jan-Willem Roorda, Orna Grumberg
2009 Logical Methods in Computer Science  
Generalised Symbolic Trajectory Evaluation (GSTE) is a high-capacity formal verification technique for hardware.  ...  The contribution of this paper is a faithful semantics for GSTE.  ...  Thanks to Tom Melham, Mary Sheeran, Rachel Tzoref, and the anonymous referees for commenting on earlier drafts of this paper.  ... 
doi:10.2168/lmcs-5(2:1)2009 fatcat:zxfqftkpwfcmtpymbujplzen6a

Improved semantics and implementation through property-based testing with QuickCheck

Huiqing Li, Simon Thompson
2014 Proceedings of the 9th International Workshop on Automation of Software Test - AST 2014  
-in this case Erlang -for writing executable semantics.  ...  In this paper, we demonstrate an approach to validating an executable semantics using property-and model-based random testing in QuickCheck to automate and unify the testing of the semantics and its implementation  ...  This is used to decide whether or not to include a candidate command in test cases. A symbolic command binds a symbolic variable to the result of a symbolic function call, for example 2] ).  ... 
doi:10.1145/2593501.2593509 dblp:conf/icse/LiT14 fatcat:a7lbgbmfmbbkrecigc4eqw423a

The hidden models of model checking

Willem Visser, Matthew B. Dwyer, Michael Whalen
2012 Journal of Software and Systems Modeling  
In the past, applying formal analysis, such as model checking, to industrial problems required a team of formal methods experts and a great deal of effort.  ...  We illustrate the value of hidden models by surveying successful examples of their use in different areas of model checking (hardware and software) and how a lack of suitable models hamper a new area (  ...  Finally, model checking tools are built to support the semantics of their input language. When expressing a domain model in such a language the semantics of the domain model are lost.  ... 
doi:10.1007/s10270-012-0281-9 fatcat:hpfpl3ufwrhpxbhg7koafunnuq

Formal techniques for SystemC verification

Moshe Y. Vardi
2007 Proceedings - Design Automation Conference  
By formal techniques we refer here to a range of techniques, including assertion-based dynamic validation, symbolic simulation, formal test generation, explicit-state model checking, and symbolic model  ...  SystemC has emerged lately as a de facto, open, industry standard modeling language, enabling a wide range of modeling levels, from RTL to system level.  ...  The difficulty of extending symbolic model checking to SystemC is that symbolic model checking requires that we have formal semantics that describes the transition relation of the design.  ... 
doi:10.1145/1278480.1278527 dblp:conf/dac/Vardi07 fatcat:pucrpnf2kngmrmmvi64rg65gki
« Previous Showing results 1 — 15 out of 80,266 results