Sciweavers

4722 search results - page 294 / 945
» Representation-independent program analysis
Sort
View
CHARME
2003
Springer
196views Hardware» more  CHARME 2003»
15 years 11 months ago
Analyzing the Intel Itanium Memory Ordering Rules Using Logic Programming and SAT
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom, K...
CSMR
1998
IEEE
15 years 10 months ago
Towards Mature Measurement Programs
Many organizations are using measurement as a means to improve their software development and maintenance processes. A reasonable consensus has been reached about the main success...
Frank Niessink, Hans van Vliet
ICLP
1999
Springer
15 years 10 months ago
Comparing Trailing and Copying for Constraint Programming
A central service of a constraint programming system is search. In almost all constraint programming systems search is based on trailing, which is well understood and known to be ...
Christian Schulte
SLP
1993
110views more  SLP 1993»
15 years 7 months ago
Logic Program Specialisation With Deletion of Useless Clauses
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
D. Andre de Waal, John P. Gallagher
ECAI
2010
Springer
15 years 7 months ago
On the Verification of Very Expressive Temporal Properties of Non-terminating Golog Programs
Abstract. The agent programming language GOLOG and the underlying Situation Calculus have become popular means for the modelling and control of autonomous agents such as mobile rob...
Jens Claßen, Gerhard Lakemeyer