Sciweavers

213 search results - page 24 / 43
» Automated Termination Analysis for Logic Programs with Cut
Sort
View
CADE
2007
Springer
16 years 1 days ago
Dependency Pairs for Rewriting with Non-free Constructors
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
Stephan Falke, Deepak Kapur
META
1992
15 years 3 months ago
Propagation: A New Operation in a Framework for Abstract Interpretation of Logic Programs
ract Interpretation of Logic Programs Maurice Bruynooghe and Gerda :Ianssens Department of Computer Science, Katholleke Universiteit Leuven Celestijnenlaan 200A, B-3001 Heverlee, B...
Maurice Bruynooghe, Gerda Janssens
WCRE
2009
IEEE
15 years 6 months ago
The Logical Modularity of Programs
Abstract—The principles and best practices of object oriented design require that modules in a program should match logical decomposition of the knowledge that the program implem...
Daniel Ratiu, Radu Marinescu, Jan Jürjens
ICFP
2006
ACM
15 years 11 months ago
Static analysis for syntax objects
We describe an s-expression based syntax-extension framework much like Scheme macros, with a key additional facility: the ability to define static semantics, such as type systems ...
David Fisher, Olin Shivers
FLOPS
2006
Springer
15 years 3 months ago
Soutei, a Logic-Based Trust-Management System
We describe the design and implementation of a trust-management system Soutei, a dialect of Binder, for access control in distributed systems. Soutei policies and credentials are w...
Andrew Pimlott, Oleg Kiselyov