Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Denmat, Tristan"'
Publikováno v:
EPTCS 107, 2013, pp. 25-43
Iterative imperative programs can be considered as infinite-state systems computing over possibly unbounded domains. Studying reachability in these systems is challenging as it requires to deal with an infinite number of states with standard backward
Externí odkaz:
http://arxiv.org/abs/1302.3290
A program invariant is a property that holds for every execution of the program. Recent work suggest to infer likely-only invariants, via dynamic analysis. A likely invariant is a property that holds for some executions but is not guaranteed to hold
Externí odkaz:
http://arxiv.org/abs/cs/0508108
Publikováno v:
In Information and Software Technology 2007 49(9):1030-1044
Publikováno v:
Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming (CP'07)
the 13th International Conference on Principles and Practice of Constraint Programming (CP'07)
the 13th International Conference on Principles and Practice of Constraint Programming (CP'07), Sep 2007, France. pp.00-00
the 13th International Conference on Principles and Practice of Constraint Programming (CP'07)
the 13th International Conference on Principles and Practice of Constraint Programming (CP'07), Sep 2007, France. pp.00-00
International audience; We present the w constraint combinator that models while loops in Constraint Programming. Embedded in a finite domain constraint solver, it allows programmers to develop non-trivial arithmetical relations using loops, exactly
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::fa252835c63634bc9278401e5532dd6a
https://hal.archives-ouvertes.fr/hal-00180548
https://hal.archives-ouvertes.fr/hal-00180548
Publikováno v:
[Research Report] RR-5661, INRIA. 2005, pp.21
[Research Report] PI 1743, 2005, pp.21
[Research Report] PI 1743, 2005, pp.21
The current trend in debugging and testing is to cross-check information collected during several executions. Jones et al., for example, propose to use the instruction coverage of passing and failing runs in order to visualize suspicious statements.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::729d38d8686c779f5c9b633bd155026c
https://inria.hal.science/inria-00070347/file/RR-5661.pdf
https://inria.hal.science/inria-00070347/file/RR-5661.pdf
Publikováno v:
International Conference on Automated Software Engineering
International Conference on Automated Software Engineering, 2005, Long Beach, United States
International Conference on Automated Software Engineering, 2005, Long Beach, United States
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::8c5baba06c65f1410282e6984082c20e
https://hal.inria.fr/hal-00756834
https://hal.inria.fr/hal-00756834
Publikováno v:
18th IEEE International Symposium on Software Reliability (ISSRE '07); 2007, p181-190, 10p
Autor:
Hutchison, David, Kanade, Takeo, Kittler, Josef, Kleinberg, Jon M., Mattern, Friedemann, Mitchell, John C., Naor, Moni, Nierstrasz, Oscar, Pandu Rangan, C., Steffen, Bernhard, Sudan, Madhu, Terzopoulos, Demetri, Tygar, Doug, Vardi, Moshe Y., Weikum, Gerhard, Bessière, Christian, Denmat, Tristan, Gotlieb, Arnaud, Ducassé, Mireille
Publikováno v:
Principles & Practice of Constraint Programming - CP 2007; 2007, p241-255, 15p
Publikováno v:
Proceedings of the 20th IEEE/ACM International Conference: Automated Software Engineering; 11/ 7/2005, p396-399, 4p
Publikováno v:
Proceedings of the 20th IEEE/ACM International Conference: Automated Software Engineering; 11/ 7/2005, p313-316, 4p