172 search results - page 19 / 35 » Automatic Termination Analysis of Logic Programs |
180
click to vote
ERSHOV
2009
Springer
15 years 8 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
138
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
121
click to vote
SIGSOFT
2005
ACM
16 years 5 months ago
2005
ACM
Fluent model checking is an automated technique for verifying that an event-based operational model satisfies some state-based declarative properties. The link between the event-b...
120
Voted
CADE
2008
Springer
16 years 4 months ago
2008
Springer
Rely-guarantee (RG) reasoning is useful for modular Hoare-style proofs of concurrent programs. However, RG requires that assertions be proved stable under the actions of the enviro...
144
click to vote
EUROSYS
2007
ACM
15 years 8 months ago
2007
ACM
Middleware simplifies the construction of distributed applications. These applications typically require continuous uptime. The maintenance of distributed applications, though, im...