Sciweavers

186 search results - page 5 / 38
» Decidable Extensions of Church's Problem
Sort
View
LISA
2004
13 years 11 months ago
Gatekeeper: Monitoring Auto-Start Extensibility Points (ASEPs) for Spyware Management
Spyware is a rapidly spreading problem for PC users causing significant impact on system stability and privacy concerns. It attaches to extensibility points in the system to ensur...
Yi-Min Wang, Roussi Roussev, Chad Verbowski, Aaron...
FORMATS
2009
Springer
14 years 4 months ago
Realizability of Real-Time Logics
Abstract. We study the realizability problem for specifications of reactive systems expressed in real-time linear temporal logics. The logics we consider are subsets of MITL (Metr...
Laurent Doyen, Gilles Geeraerts, Jean-Franç...
LICS
2010
IEEE
13 years 8 months ago
The Emptiness Problem for Tree Automata with Global Constraints
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
Luis Barguñó, Carles Creus, Guillem ...
TIME
2006
IEEE
14 years 3 months ago
Ultimately Periodic Simple Temporal Problems (UPSTPs)
In this paper, we consider quantitative temporal or spatial constraint networks whose constraints evolve over time in an ultimately periodic fashion. These constraint networks are...
Jean-François Condotta, Gérard Ligoz...
RTA
2005
Springer
14 years 3 months ago
Arithmetic as a Theory Modulo
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
Gilles Dowek, Benjamin Werner