81 search results - page 7 / 17 » On the verification of polynomial system solvers |
BIRTHDAY
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Probabilistic systems of interacting intelligent agents are considered. They have two sources of uncertainty: uncertainty of communication channels and uncertainty of act...
PLDI
2010
ACM
14 years 4 months ago
2010
ACM
A number of programming languages use rich type systems to verify security properties of code. Some of these languages are meant for source programming, but programs written in th...
CADE
2008
Springer
14 years 7 months ago
2008
Springer
Abstract. We introduce the notion of array-based system as a suittraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-...
24
Voted
CADE
2007
Springer
14 years 7 months ago
2007
Springer
We introduce a calculus for handling integer arithmetic in first-order logic. The method is tailored to Java program verification and meant to be used both as a supporting procedur...
ICSE
2003
IEEE-ACM
14 years 7 months ago
2003
IEEE-ACM
We present a new methodology for automatic verification of C programs against finite state machine specifications. Our approach is compositional, naturally enabling us to decompos...