Sciweavers

444 search results - page 7 / 89
» Automated Logical Verification Based on Trace Abstractions
Sort
View
ASE
2005
137views more  ASE 2005»
13 years 7 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
LICS
1992
IEEE
13 years 11 months ago
Asynchronous Communication in Process Algebra
d Abstract) Frank S. de Boer, Jan Willem Klopyz , Catuscia Palamidessiyx We study the paradigm of asynchronous process communication, as contrasted with the synchronous communicat...
Frank S. de Boer, Jan Willem Klop, Catuscia Palami...
TPHOL
1998
IEEE
13 years 11 months ago
Object-Oriented Verification Based on Record Subtyping in Higher-Order Logic
We show how extensible records with structural subtyping can be represented directly in Higher-Order Logic (HOL). Exploiting some specific properties of HOL, this encoding turns o...
Wolfgang Naraschewski, Markus Wenzel
CORR
2008
Springer
104views Education» more  CORR 2008»
13 years 7 months ago
A General Framework for Sound and Complete Floyd-Hoare Logics
er presents an abstraction of Hoare logic to traced symmetric monoidal categories, a eral framework for the theory of systems. Our abstraction is based on a traced monoidal functor...
Rob Arthan, Ursula Martin, Erik A. Mathiesen, Paul...
CADE
2007
Springer
14 years 7 months ago
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
Yeting Ge, Clark Barrett, Cesare Tinelli