1809 search results - page 76 / 362 » Software Model Checking Using Linear Constraints |
CSL
2006
Springer
14 years 22 days ago
2006
Springer
Game quantification is an expressive concept and has been studied in model theory and descriptive set theory, especially in relation to infinitary logics. Automatic structures on t...
COMPULOG
1999
Springer
14 years 1 months ago
1999
Springer
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
LMCS
2007
13 years 9 months ago
2007
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
GI
2009
Springer
13 years 6 months ago
2009
Springer
Abstract: Today's trend in software and system engineering is to utilize more specialized models. This model-based development approach makes a single engineering task more ea...
ICFEM
2009
Springer
13 years 6 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...