Filters








6,050 Hits in 6.7 sec

Simulating reachability using first-order logic with applications to verification of linked data structures

Tal Lev-Ami, Neil Immerman, Thomas Reps, Mooly Sagiv, Siddharth Srivastava, Greta Yorsh, Pierre Wolper
2009 Logical Methods in Computer Science  
The main technical contributions are methods for simulating reachability in a conservative way using first-order formulas--the formulas describe a superset of the set of program states that would be specified  ...  This paper shows how to harness existing theorem provers for first-order logic to automatically verify safety properties of imperative programs that perform dynamic storage allocation and destructive updating  ...  Moreover, the simulation requirements are not necessarily expressible in the decidable logic. Other First-Order Axiomatizations of Linked Data Structures.  ... 
doi:10.2168/lmcs-5(2:12)2009 fatcat:6jnbgs673vah7gvezkz44lf4gq

Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures [chapter]

T. Lev-Ami, N. Immerman, T. Reps, M. Sagiv, S. Srivastava, G. Yorsh
2005 Lecture Notes in Computer Science  
The main technical contributions are methods for simulating reachability in a conservative way using first-order formulas-the formulas describe a superset of the set of program states that can actually  ...  This paper shows how to harness existing theorem provers for first-order logic to automatically verify safety properties of imperative programs that perform dynamic storage allocation and destructive updating  ...  Moreover, the simulation requirements are not necessarily expressible in the decidable logic. Other First-Order Axiomatizations of Linked Data Structures.  ... 
doi:10.1007/11532231_8 fatcat:5bxtjx76ibamhkc6aux5asrvrq

Verification via Structure Simulation [chapter]

Niel Immerman, Alexander Rabinovich, Thomas W. Reps, Mooly Sagiv, Great Yorsh
2004 Lecture Notes in Computer Science  
Decidable logics that can express reachability properties are used to state properties of linked data structures, while guaranteeing that the verification method always terminates.  ...  In this paper, we allow pre-conditions, post-conditions, and loop invariants to be specified in FO(TC): first-order formulas with transitive closure.  ...  Even simple decidable fragments of first-order logic become undecidable when reachability is added [9] . The reader may wonder how undecidable logics can be useful for automatic verification.  ... 
doi:10.1007/978-3-540-27813-9_22 fatcat:xphcjvwsh5gezajsaooxwxbnm4

Field Constraint Analysis [chapter]

Thomas Wies, Viktor Kuncak, Patrick Lam, Andreas Podelski, Martin Rinard
2005 Lecture Notes in Computer Science  
Field constraints enable the application of decidable logics to data structures which were originally beyond the scope of these logics, by verifying the backbone of the data structure and then verifying  ...  The generality of our field constraints requires new techniques, which are orthogonal to the traditional use of structure simulation. We present one such technique and prove its soundness.  ...  These sets are defined by using formulas in first-order logic with reflexive transitive closure.  ... 
doi:10.1007/11609773_11 fatcat:argttkyo4bf7bav4s2ppkjkozi

A Survey on Network Verification and Testing with Formal Methods: Approaches and Challenges

Yahui Li, Xia Yin, Zhiliang Wang, Jiangyuan Yao, Xingang Shi, Jianping Wu, Han Zhang, Qing Wang
2018 IEEE Communications Surveys and Tutorials  
As an area of current interest, it is an interdisciplinary subject (with fields including formal methods, mathematical logic, programming languages, and networks), making it daunting for a nonprofessional  ...  We perform a comprehensive survey on well-developed methodologies and tools for data plane verification, control plane verification, data plane testing and control plane testing.  ...  In contrast, VeriCon [54] uses first-order logic to formulate the network and invariants, and it then proves the correctness of the program.  ... 
doi:10.1109/comst.2018.2868050 fatcat:h3op4heca5d75bpokfsbfevnwe

Applying Formal Methods to Networking: Theory, Techniques, and Applications

Junaid Qadir, Osman Hasan
2015 IEEE Communications Surveys and Tutorials  
This has also led to a great resurgence in interest of applying formal methods to specification, verification, and synthesis of networking protocols and applications.  ...  In this paper, we present a self-contained tutorial of the formidable amount of work that has been done in formal methods, and present a survey of its applications to networking.  ...  While predicate logic subsumes first-order logic, second-order logic, or infinitary logic, etc., the unqualified use of predicate logic typically refers to first-order logic.  ... 
doi:10.1109/comst.2014.2345792 fatcat:oc6l6pn4tnddjbbr5v4gbbuycq

Full functional verification of linked data structures

Karen Zee, Viktor Kuncak, Martin Rinard
2008 Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation - PLDI '08  
Specifically, we present the use of the Jahob verification system to verify formal specifications, written in classical higher-order logic, that completely capture the desired behavior of the Java data  ...  We present the first verification of full functional correctness for a range of linked data structure implementations, including mutable lists, trees, graphs, and hash tables.  ...  We thank Charles Bouillaguet for developing the interface to first-order provers [14] . We also thank the anonymous reviewers and our shepherd, Rajeev Alur, for their useful feedback on the paper.  ... 
doi:10.1145/1375581.1375624 dblp:conf/pldi/ZeeKR08 fatcat:xdwn3c6bdvgpvkzakt44gj7iu4

Full functional verification of linked data structures

Karen Zee, Viktor Kuncak, Martin Rinard
2008 SIGPLAN notices  
Specifically, we present the use of the Jahob verification system to verify formal specifications, written in classical higher-order logic, that completely capture the desired behavior of the Java data  ...  We present the first verification of full functional correctness for a range of linked data structure implementations, including mutable lists, trees, graphs, and hash tables.  ...  We thank Charles Bouillaguet for developing the interface to first-order provers [14] . We also thank the anonymous reviewers and our shepherd, Rajeev Alur, for their useful feedback on the paper.  ... 
doi:10.1145/1379022.1375624 fatcat:lblfpn5a5nh6jm276xlgbzxp24

Inductive Reasoning for Shape Invariants

Lilia Georgieva, Patrick Maier
2009 International Workshops on First Order Theorem Proving  
We use off-the-shelf first-order theorem provers to reason about these specifications.  ...  We specify heap data structures such as lists, arrays of lists, and trees inductively as solutions of logic programs.  ...  This paper reflects only the authors' views and the European Community is not liable for any use that may be made of the information contained therein.  ... 
dblp:conf/ftp/Georgieva009 fatcat:hz3tdxjkqbex5ilzblushrxip4

Verification of Computer Switching Networks: An Overview [chapter]

Shuyuan Zhang, Sharad Malik, Rick McGeer
2012 Lecture Notes in Computer Science  
Formal verification has seen much success in several domains of hardware and software design.  ...  symbolic simulation, model checking, and propositional logic verification using SAT.  ...  As a result, in practice the FSM and combinational logic based approaches will wind up doing the same calculation over mathematically-equivalent objects; all that differs is the data structures used to  ... 
doi:10.1007/978-3-642-33386-6_1 fatcat:jyp4ytxq4ralnafeq7yj4h2n64

A Comparative Assessment of Collaborative Business Process Verification Approaches [chapter]

John Paul Kasse, Lai Xu, Paul de Vrieze
2017 IFIP Advances in Information and Communication Technology  
We also look at how big data impacts the business process verification approach in a data-rich world.  ...  Research in business process model verification has yielded a plethora of approaches in form of languages and tools that are based on Petri nets family and temporal logic.  ...  Besides, best practice linking verification approaches to vF cBPs is missing. The EU H2020 FIRST project aims to develop a method to support non expert end users to model and verify vF cBPs.  ... 
doi:10.1007/978-3-319-65151-4_33 fatcat:gzqlcqiswjhd5plfbl5w7hzyeq

Poling: SMT Aided Linearizability Proofs [chapter]

He Zhu, Gustavo Petri, Suresh Jagannathan
2015 Lecture Notes in Computer Science  
Proofs of linearizability of concurrent data structures generally rely on identifying linearization points to establish a simulation argument between the implementation and the specification.  ...  However, for many linearizable data structure operations, the linearization points may not correspond to their internal static code locations; for example, they might reside in the code of another concurrent  ...  Poling abstracts concurrent data structure into sets of locations following [17] and considers linearizability verification as a property checking technique, which are efficiently solved with an SMT  ... 
doi:10.1007/978-3-319-21668-3_1 fatcat:ihiqi6xjffhnzdaaov2kl6gt24

Two approaches linking a test generation tool with verification techniques [chapter]

Marylène Clatin, Roland Groz, Marc Phalippou, Richard Thummel
1996 Protocol Test Systems VIII  
The first method is a kind of symbolic execution. The second method consists in linking the test generation tool with a tool permitting sophisticated types of reachability analysis.  ...  This paper presents two methods implemented in a test generation tool to compute significant feasible test paths including parameter values for input-output events.  ...  Reachability technique Another way of computing transition chains consists in using a simulator. In our case, we have coupled TVEDA with Veda.  ... 
doi:10.1007/978-0-387-34988-6_10 fatcat:jdpbuufisvg4zhgjisruv56rom

Providing Automated Verification in HOL Using MDGs [chapter]

Tarek Mhamdi, Sofiène Tahar
2004 Lecture Notes in Computer Science  
We deeply embedded the MDG underlying logic in HOL and implemented a platform that provides a set of algorithms allowing the user to develop his/her own state-exploration based application inside HOL.  ...  We have been able to implement and experiment with different state exploration techniques within HOL such as MDG reachability analysis, equivalence and model checking.  ...  Once available inside the theorem prover, the MDG data structure and operators can be used to automate parts of the verification problem or even to write state enumeration algorithms like reachability  ... 
doi:10.1007/978-3-540-30476-0_24 fatcat:hdnnll3ldfd6vipdvgazdffd4a

Effectively-Propositional Reasoning about Reachability in Linked Data Structures [chapter]

Shachar Itzhaky, Anindya Banerjee, Neil Immerman, Aleksandar Nanevski, Mooly Sagiv
2013 Lecture Notes in Computer Science  
This paper proposes a novel method of harnessing existing SAT solvers to verify reachability properties of programs that manipulate linked-list data structures.  ...  We implemented a tool atop Z3 and used it to show the correctness of several linked list programs.  ...  ), except that our solution is geared towards verification of heap-manipulating programs with linked data structures.  ... 
doi:10.1007/978-3-642-39799-8_53 fatcat:ltfnbbpqojhmdl5keahlc762py
« Previous Showing results 1 — 15 out of 6,050 results