Sciweavers

1204 search results - page 148 / 241
» Termination of Polynomial Programs
Sort
View
120
Voted
ENTCS
2000
80views more  ENTCS 2000»
15 years 3 months ago
Behavioral and Coinductive Rewriting
Behavioral rewriting di ers from standard rewriting in taking account of the weaker inference rules of behavioral logic, but it shares much with standard rewriting, including noti...
Joseph A. Goguen, Kai Lin, Grigore Rosu
194
Voted
CAV
2012
Springer
334views Hardware» more  CAV 2012»
13 years 6 months ago
Joogie: Infeasible Code Detection for Java
We present Joogie, a tool that detects infeasible code in Java programs. Infeasible code is code that does not occur on feasible controlflow paths and thus has no feasible executi...
Stephan Arlt, Martin Schäf
136
Voted
DAGSTUHL
1996
15 years 4 months ago
Global Control for Partial Deduction through Characteristic Atoms and Global Trees
Recently, considerable advances have been made in the (on-line) control of logic program specialisation. A clear conceptual distinction has been established between local and glob...
Michael Leuschel, Bern Martens
ESOP
2010
Springer
16 years 28 days ago
Amortised Resource Analysis with Separation Logic
Type-based amortised resource analysis following Hofmann and Jost--where resources are associated with individual elements of data structures and doled out to the programmer under ...
Robert Atkey
ATAL
2007
Springer
15 years 9 months ago
ARTS: agent-oriented robust transactional system
This paper presents the ARTS (Agent-oriented Robust Transactional System) model, which applies transaction concepts to provide agent developers with high-level support for agent s...
Mingzhong Wang, Amy Unruh, Kotagiri Ramamohanarao