10568 search results - page 684 / 2114 » Computer Intelligence and Formalization |
192
click to vote
FORMATS
2006
Springer
15 years 11 months ago
2006
Springer
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
205
click to vote
FOSSACS
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. Rewriting systems over adhesive categories have been recently introduced as a general framework which encompasses several rewriting-based computational formalisms, includ...
185
click to vote
ICDCSW
2000
IEEE
15 years 10 months ago
2000
IEEE
Model-checking has turned out to be an efficient and relatively easy-to-use technique in the verification of formally described programs. However, there is one major drawback in u...
217
click to vote
SAC
2000
ACM
15 years 10 months ago
2000
ACM
Abstract. Formal grammars are well established for specifying the syntax of programming languages. However, the formal specification of programming language semantics has proven mo...
176
click to vote
DSVIS
1995
Springer
15 years 10 months ago
1995
Springer
This paper introduces a formal model for the description of interactive systems based on the interactor model of [15, 17]. Similarly to that model, it is intended to be used constr...