2514 search results - page 257 / 503 » The use of industrial-strength formal methods |
167
click to vote
FM
2001
Springer
15 years 11 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
166
click to vote
SAS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
146
click to vote
IFM
1999
Springer
15 years 11 months ago
1999
Springer
: Some of the shortcomings of using refinement alone as the means of passing from high level simple models to actual detailed implementations are reviewed. Retrenchment is presente...
150
click to vote
KBSE
1998
IEEE
15 years 11 months ago
1998
IEEE
Specification-based retrieval provides exact contentoriented access to component libraries but requires too much deductive power. Specification-based browsing evades this bottlene...
187
click to vote
FTRTFT
1998
Springer
15 years 10 months ago
1998
Springer
PLC-Automata are a class of real-time automata suitable to describe the behavior of polling real-time systems. PLC-Automata can be compiled to source code for PLCs, a hardware wide...