2989 search results - page 144 / 598 » Using Domain-Independent Problems for Introducing Formal Met... |
IFL
1997
Springer
15 years 2 months ago
1997
Springer
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
FORMATS
2003
Springer
15 years 3 months ago
2003
Springer
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
ICLP
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Action description languages, such as A and B [6], are expressive instruments introduced for formalizing planning domains and problems. The paper starts by proposing a me...
PLDI
1997
ACM
15 years 2 months ago
1997
ACM
A major research goal for compilers and environments is the automatic derivation of tools from formal specifications. However, the formal model of the language is often inadequat...
102
click to vote
SAS
1994
Springer
15 years 2 months ago
1994
Springer
Constraint-based analysis is a technique for inferring implementation types. Traditionally it has been described using mathematical formalisms. We explain it in a different and mor...