232 search results - page 42 / 47 » Symbolic Bounded Conformance Checking of Model Programs |
142
click to vote
ENTCS
2007
15 years 2 months ago
2007
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
131
Voted
POPL
2012
ACM
13 years 10 months ago
2012
ACM
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
109
Voted
ACSD
2006
IEEE
15 years 8 months ago
2006
IEEE
A schedule of a Petri Net (PN) represents a set of firing sequences that can be infinitely repeated within a bounded state space, regardless of the outcomes of the nondeterminis...
113
Voted
WWW
2005
ACM
16 years 3 months ago
2005
ACM
We present a design for verification approach to developing reliable web services. We focus on composite web services which consist of asynchronously communicating peers. Our goal...
135
Voted
PPDP
2007
Springer
15 years 8 months ago
2007
Springer
The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has r...