Sciweavers

1461 search results - page 95 / 293
» Analysis of Constraint Logic Programs
Sort
View
OPODIS
2003
14 years 11 months ago
Detecting Temporal Logic Predicates in Distributed Programs Using Computation Slicing
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
Alper Sen, Vijay K. Garg
CORR
2011
Springer
115views Education» more  CORR 2011»
14 years 1 months ago
SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers
ibe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a non-trivial extension ...
Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amra...
POPL
2009
ACM
15 years 10 months ago
Relaxed memory models: an operational approach
Memory models define an interface between programs written in some language and their implementation, determining which behaviour the memory (and thus a program) is allowed to hav...
Gérard Boudol, Gustavo Petri
CISIS
2010
IEEE
15 years 4 months ago
Logic-Based Steady-State Analysis and Revision of Metabolic Networks with Inhibition
—This paper presents a qualitative logic-based method for the steady-state analysis and revision of metabolic networks with inhibition. The approach is able to automatically revi...
Oliver Ray, Ken E. Whelan, Ross D. King
MICRO
1993
IEEE
131views Hardware» more  MICRO 1993»
15 years 2 months ago
Superblock formation using static program analysis
Compile-time code transformations which expose instruction-level parallelism (ILP) typically take into account the constraints imposed by all execution scenarios in the program. H...
Richard E. Hank, Scott A. Mahlke, Roger A. Bringma...