Sciweavers

4211 search results - page 348 / 843
» A formal approach to MASQ
Sort
View
178
Voted
FMCO
2006
Springer
123views Formal Methods» more  FMCO 2006»
15 years 10 months ago
Exhaustive Testing of Exception Handlers with Enforcer
Testing application behavior in the presence of I/O failures is extremely difficult. The resources used for testing usually work without failure. Failures typically cannot be initi...
Cyrille Artho, Armin Biere, Shinichi Honiden
FMCO
2006
Springer
135views Formal Methods» more  FMCO 2006»
15 years 10 months ago
Links: Web Programming Without Tiers
Links is a programming language for web applications that generates code for all three tiers of a web application from a single source, compiling into JavaScript to run on the clie...
Ezra Cooper, Sam Lindley, Philip Wadler, Jeremy Ya...
FORMATS
2006
Springer
15 years 10 months ago
Matching Scenarios with Timing Constraints
Networks of communicating finite-state machines equipped with local clocks generate timed MSCs. We consider the problem of checking whether these timed MSCs are "consistent&qu...
Prakash Chandrasekaran, Madhavan Mukund
FQAS
2006
Springer
94views Database» more  FQAS 2006»
15 years 10 months ago
Term Disambiguation in Natural Language Query for XML
Converting a natural language query sentence into a formal database query is a major challenge. We have constructed NaLIX, a natural language interface for querying XML data. Throu...
Yunyao Li, Huahai Yang, H. V. Jagadish
ADBIS
1995
Springer
130views Database» more  ADBIS 1995»
15 years 10 months ago
Magic Sets vs. SLD-Resolution
It is by now folklore that the bottom-up evaluation of a program after the “magic set” transformation is “as efficient as” top-down evaluation. There are a number of forma...
Stefan Brass