L. Fribourg and M. Veloso-Peixoto. Automates Concurrents a Contraintes. Technique et Science Informatiques, 13(6):837-- 866, 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Higher-Order Automata, Pushdown systems, and Set Constraints - Goubault-Larrecq (2001) (Correct)
....that contain only blocks without losing completeness. 5 Higher Order Automata, Pushdown Systems and Set Constraints We define higher order automata, higher order pushdown systems, and higher order set constraints as particular sets of clauses. The idea dates back to Fribourg and VelosoPeixoto [8], and to Podelski and Charatonik [6] 5.1 Definitions We consider clauses build from unary predicate symbols and shallow patterns. Consider first Horn clauses of the form: P 1 ( y 1 n1 X 1 y 1 j 1 ) P k ( y k nk X k y k j k ) P ( xm hu n ) 8) where u n are ....
L. Fribourg and M. Veloso Peixoto. Automates concurrents a contraintes. Technique et Science Informatique, 13(6):837--866, 1994. 14
Experiments with Finite Tree Automata in Coq - Rival, al. (2001) (Correct)
....when considering deterministic tree automata [7] In the sequel, we shall only consider non deterministic tree automata, allowing us to avoid the bottom up top down dilemma. Another, perhaps less well known data structure for representing tree automata is as sets of first order Horn clauses [6, 4]. Each state q is translated to a unary predicate P q think of P q (t) meaning t is recognized at state q while transitions f(q 1 ; q n ) q are translated to clauses of the form P q (f(x 1 ; xn ) P q1 (x 1 ) P qn (x n ) 4 q even q odd q list even S ( ....
L. Fribourg and M. Veloso Peixoto. Automates concurrents a contraintes. Technique et Science Informatique, 13(6):837--866, 1994.
Constraint-based Deductive Model Checking - Delzanno, Podelski (2001) (8 citations) (Correct)
....Fig. 18. Benchmarks for the veri cation of safety: C=number of clauses, E=exact, A=approximation with widening, R=elimination of redundant facts, T=execution time, N=number of produced facts, non termination, not needed. The execution time is given in seconds. tems and temporal properties. In [FV94] Fribourg and Veloso Pexoto de ne the notion of automata with constraints and study their properties (e.g. language inclusion) through a representation as CLP programs. In [FR96] Fribourg and Richardson use CLP programs over gap order integer constraints [Rev93] in order to compute the set of ....
L. Fribourg and M. Veloso-Peixoto. Automates Concurrents Contraintes. Technique et Science Informatiques, 13(6):837-866, 1994.
Constraint-based Deductive Model Checking - Delzanno, Podelski (2001) (8 citations) (Correct)
....All the veri cation problems have been tested on a Sun Sparc Station 4, OS 5.5.1. 8 Related Work There have been other attempts to connect logic programming and veri cation, none of which has our generality with respect to the applicable concurrent systems and temporal properties. In [FV94] Fribourg and Veloso Pexoto de ne the notion of automata with constraints and study their properties (e.g. language inclusion) through a representation as CLP programs. In [FR96] Fribourg and Richardson use CLP programs over gap order integer constraints [Rev93] in order to compute the set of ....
L. Fribourg and M. Veloso-Peixoto. Automates Concurrents Contraintes. Technique et Science Informatiques, 13(6):837-866, 1994.
Model Based Testing for Real: The Inhouse Card Case Study - Pretschner, Slotosch.. (2001) (1 citation) (Correct)
No context found.
L. Fribourg and M. Veloso-Peixoto. Automates Concurrents a Contraintes. Technique et Science Informatiques, 13(6):837-- 866, 1994.
Classical Search Strategies for Test Case Generation with.. - Pretschner (2001) (6 citations) (Correct)
No context found.
L. Fribourg and M. Veloso-Peixoto. Automates Concurrents a Contraintes. Technique et Science Informatiques, 13(6):837--866, 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC