2722 search results - page 334 / 545 » Automating Language Evolution |
190
click to vote
LPAR
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification...
150
click to vote
TACAS
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We present a tool for the formal verification of ANSI-C programs using Bounded Model Checking (BMC). The emphasis is on usability: the tool supports almost all ANSI-C la...
160
click to vote
DISCEX
2003
IEEE
15 years 11 months ago
2003
IEEE
Efforts toward automated detection and identification of multistep cyber attack scenarios would benefit significantly from a methodology and language for modeling such scenario...
206
click to vote
TIME
2003
IEEE
15 years 11 months ago
2003
IEEE
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algo...
186
click to vote
FPL
2009
Springer
15 years 11 months ago
2009
Springer
Reconfigurable systems are widely used nowadays to increase performance of computationally intensive applications. There exist a lot of synthesis tools that automatically generate...