814 search results - page 84 / 163 » Generic Model Abstraction from Examples |
120
Voted
ATVA
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
150
click to vote
DAC
2003
ACM
16 years 4 months ago
2003
ACM
In the Artemis project [13], design space exploration of embedded systems is provided by modeling application behavior and architectural performance constraints separately. Mappin...
151
click to vote
TPHOL
2008
IEEE
15 years 9 months ago
2008
IEEE
g to the well-known “LCF approach” of secure inferences as abstract datatype constructors in ML [16]; explicit proof terms are also available [8]. Isabelle/Isar provides sophis...
128
click to vote
MICS
2010
15 years 1 months ago
2010
Abstract. There is something of a discontinuity at the heart of popular tactical theorem provers. Low-level, fully-checked mechanical proofs are large trees consisting of primitive...
125
click to vote
AIPS
1996
15 years 4 months ago
1996
An increasing number of planners can handle uncertainty in the domain or in action outcomes. However, less work has addressed building plans when the planner's world can chan...