566 search results - page 105 / 114 » Array Abstractions from Proofs |
CADE
2004
Springer
14 years 7 months ago
2004
Springer
contexts such as construction of abstractions, speed may be favored over completeness, so that undecidable theories (e.g., nonlinear integer arithmetic) and those whose decision pr...
POPL
2010
ACM
14 years 4 months ago
2010
ACM
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
SPIN
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Symbolic reachability analysis provides a basis for the verification of software systems by offering algorithmic support for the exploration of the program state space ...
SIGECOM
2009
ACM
14 years 2 months ago
2009
ACM
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
ASM
2003
ASM
14 years 22 days ago
2003
ASM
r in: Abstract State Machines 2003 — Advances in Theory and Applications, Proc. 10th International Workshop, Taormina, Italy, March 3-7, 2003, eds. Egon Boerger, Angelo Gargantin...