114 search results - page 16 / 23 » Model-Checking Systems with Unbounded Variables without Abst... |
133
Voted
APLAS
2005
ACM
15 years 9 months ago
2005
ACM
Interpretation interpretation is a theory of effective abstraction and/or approximation of discrete mathematical structures as found in the semantics of programming languages, mod...
153
Voted
KBSE
2005
IEEE
15 years 9 months ago
2005
IEEE
In test generation based on model-checking, white-box test criteria are represented as trap conditions written in a temporal logic. A model checker is used to refute trap conditio...
142
Voted
ATAL
2005
Springer
15 years 9 months ago
2005
Springer
We present dcl-pc: a dynamic logic of delegation and cooperation. The logical foundation of dcl-pc is cl-pc, a logic for reasoning about cooperation in which the powers of agents ...
143
Voted
PLDI
2009
ACM
15 years 10 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
133
Voted
ESOP
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Higher-order abstract syntax (HOAS) refers to the technique of representing variables of an object-language using variables of a meta-language. The standard first-order a...