Sciweavers

63 search results - page 9 / 13
» Automated Termination Analysis for Programs with Second-Orde...
Sort
View
FLOPS
2006
Springer
13 years 11 months ago
Resource Analysis by Sup-interpretation
We propose a new method to control memory resources by static analysis. For this, we introduce the notion of sup-interpretation which bounds from above the size of function outputs...
Jean-Yves Marion, Romain Péchoux
GECCO
2008
Springer
180views Optimization» more  GECCO 2008»
13 years 9 months ago
Bond-graphs + genetic programming: analysis of an automatically synthesized rotary mechanical system
Initial results of an experiment devised to combine Bond-Graph modeling and simulation with genetic programming for automated design of a simple mechatronic system are reported in...
Saheeb Ahmed Kayani, Muhammad Afzaal Malik
CAV
2006
Springer
133views Hardware» more  CAV 2006»
13 years 11 months ago
Programs with Lists Are Counter Automata
Abstract. We address the verification problem of programs manipulating oneselector linked data structures. We propose a new automated approach for checking safety and termination f...
Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Ra...
DBPL
2007
Springer
103views Database» more  DBPL 2007»
13 years 11 months ago
Datalog Programs over Infinite Databases, Revisited
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
Sara Cohen, Joseph Gil, Evelina Zarivach
ICLP
1997
Springer
13 years 12 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...