Sciweavers

198 search results - page 23 / 40
» Time Equations for Lazy Functional (Logic) Languages
Sort
View
CP
2009
Springer
14 years 9 months ago
Hull Consistency under Monotonicity
We prove that hull consistency for a system of equations or inequalities can be achieved in polynomial time providing that the underlying functions are monotone with respect to eac...
Gilles Chabert, Luc Jaulin
PEPM
2011
ACM
12 years 12 months ago
Calculating tree navigation with symmetric relational zipper
Navigating through tree structures is a core operation in tree processing programs. Most notably, XML processing programs intensively use XPath, the path specification language t...
Yuta Ikeda, Susumu Nishimura
ETFA
2008
IEEE
14 years 3 months ago
Evaluation of Sequential Function Charts execution techniques. The Active Steps Algorithm
Programmable Logic Controllers (PLCs) play a significant role in the control of production systems and Sequential Function Chart (SFC) is one of the main programming languages. Th...
Ramon Piedrafita Moreno, José Luis Villarro...
LFCS
2007
Springer
14 years 3 months ago
Model Checking Knowledge and Linear Time: PSPACE Cases
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
Kai Engelhardt, Peter Gammie, Ron van der Meyden
CORR
2004
Springer
85views Education» more  CORR 2004»
13 years 9 months ago
A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree
It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of l...
Patricia M. Hill, Enea Zaffanella, Roberto Bagnara