Sciweavers

2896 search results - page 308 / 580
» Curricula Modeling and Checking
Sort
View
177
Voted
PRDC
2002
IEEE
15 years 11 months ago
Detecting Feature Interactions in Telecommunication Services with a SAT Solver
Feature interaction is a kind of inconsistent conflict between multiple communication services and considered an obstacle to developing reliable telephony systems. In this paper ...
Tatsuhiro Tsuchiya, Masahide Nakamura, Tohru Kikun...
CSFW
2006
IEEE
15 years 10 months ago
Types and Effects for Secure Service Orchestration
A distributed calculus is proposed for describing networks of services. We model service interaction through a call-by-property invocation mechanism, by specifying the security co...
Massimo Bartoletti, Pierpaolo Degano, Gian Luigi F...
FCS
2006
15 years 8 months ago
Discovering the Impact of Group Structure on 3-SAT
-- Boolean SAT problems are widespread in current demanding applications, most notably model checking for both hardware and software. It has long been known that the clause-to-vari...
James McQuillan, Craig Damon
168
Voted
FUIN
2008
101views more  FUIN 2008»
15 years 6 months ago
Translation of Intermediate Language to Timed Automata with Discrete Data
The aim of this work is to describe the translation from Intermediate Language, one of the input formalisms of the model checking platform VerICS, to timed automata with discrete d...
Agata Janowska, Pawel Janowski, Dobieslaw Wr&oacut...
CORR
2007
Springer
151views Education» more  CORR 2007»
15 years 6 months ago
The Complexity of Games on Higher Order Pushdown Automata
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
Thierry Cachat, Igor Walukiewicz