1914 search results - page 6 / 383 » Verification by Abstract Interpretation |
112
Voted
COMGEO
2010
ACM
15 years 11 days ago
2010
ACM
r Numerical Abstractions6 Roberto Bagnaraa , Patricia M. Hillb , Enea Zaffanellaa aDepartment of Mathematics, University of Parma, Italy bSchool of Computing, University of Leeds, ...
166
Voted
AGTIVE
2007
Springer
15 years 4 months ago
2007
Springer
On the basis of a case-study, we demonstrate the usefulness of topology invariants for model-driven systems development. Considering a graph grammar semantics for a relevant fragme...
105
click to vote
TCS
2008
15 years 5 days ago
2008
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparis...
71
Voted
ENTCS
2006
15 years 8 days ago
2006
The goal of this paper is to translate (fragments of) the quantified discrete duration calculus QDDC, proposed by P. Pandya, into symbolic acceptors with counters. Acceptors are w...
120
Voted
SIGSOFT
2007
ACM
16 years 1 months ago
2007
ACM
Automated verification is a technique for establishing if certain properties, usually expressed in temporal logic, hold for a system model. The model can be defined using a high-l...