Sciweavers

2419 search results - page 276 / 484
» A Formal Approach to Software Testing
Sort
View
130
Voted
SAS
1999
Springer
117views Formal Methods» more  SAS 1999»
15 years 8 months ago
Abstracting Cryptographic Protocols with Tree Automata
ing Cryptographic Protocols with Tree Automata David Monniaux http://www.di.ens.fr/%7Fmonniaux, Laboratoire d’Informatique, ´Ecole Normale Sup´erieure, 45 rue d’Ulm , 75230 P...
David Monniaux
121
Voted
CONCUR
2006
Springer
15 years 8 months ago
Concurrent Rewriting for Graphs with Equivalences
Several applications of graph rewriting systems (notably, some encodings of calculi with name passing) require rules which, besides deleting and generating graph items, are able to...
Paolo Baldan, Fabio Gadducci, Ugo Montanari
ECAI
2006
Springer
15 years 7 months ago
Unified Definition of Heuristics for Classical Planning
In many types of planning algorithms distance heuristics play an important role. Most of the earlier works restrict to STRIPS operators, and their application to a more general lan...
Jussi Rintanen
AAAI
2007
15 years 6 months ago
Fluxplayer: A Successful General Game Player
General Game Playing (GGP) is the art of designing programs that are capable of playing previously unknown games of a wide variety by being told nothing but the rules of the game....
Stephan Schiffel, Michael Thielscher
148
Voted
JSS
2010
123views more  JSS 2010»
14 years 11 months ago
Composition of architectural models: Empirical analysis and language support
Managing the architectural description (AD) of a complex software system and maintaining consistency among the different models is a demanding task. To understand the underlying p...
Nelis Boucké, Danny Weyns, Tom Holvoet