Sciweavers

655 search results - page 103 / 131
» Automata, Logic, and XML
Sort
View
CADE
2002
Springer
15 years 10 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...
SPIN
2010
Springer
14 years 8 months ago
Combining SPIN with ns-2 for Protocol Optimization
In the field of communication networks, protocol engineers usually employ several tools focused on specific kinds of analysis, such as performance or correctness. This paper pres...
Pedro Merino, Alberto Salmeron
72
Voted
DOCENG
2009
ACM
15 years 4 months ago
On the analysis of queries with counting constraints
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
Everardo Bárcenas, Pierre Genevès, N...
TOOLS
2008
IEEE
15 years 4 months ago
Guarded Program Transformations Using JTL
There is a growing research interest in employing the logic paradigm for making queries on software in general, and OOP software in particular. We describes a side-effect-free tech...
Tal Cohen, Joseph Gil, Itay Maman
ADBIS
2001
Springer
108views Database» more  ADBIS 2001»
15 years 2 months ago
An RMM-Based Methodology for Hypermedia Presentation Design
Due to the rapid growth of the Web, there is an increasing need for methodologies that support the design of Web-based Information Systems (WIS). After investigating the applicatio...
Flavius Frasincar, Geert-Jan Houben, Richard Vdovj...