Sciweavers

1750 search results - page 251 / 350
» Formal multiple-bernoulli models for language modeling
Sort
View
ISSTA
2004
ACM
15 years 3 months ago
Automating commutativity analysis at the design level
Two operations commute if executing them serially in either order results in the same change of state. In a system in which commands may be issued simultaneously by different use...
Greg Dennis, Robert Seater, Derek Rayside, Daniel ...
TACAS
2012
Springer
277views Algorithms» more  TACAS 2012»
13 years 5 months ago
Proving Reachability Using FShell - (Competition Contribution)
FShell is an automated white-box test-input generator for C programs, computing test data with respect to user-specified code coverage criteria. The pillars of FShell are the decl...
Andreas Holzer, Daniel Kroening, Christian Schallh...
TASE
2012
IEEE
13 years 5 months ago
Discrete-Event Coordination Design for Distributed Agents
— This paper presents new results on the formal design of distributed coordinating agents in a discrete-event framework. In this framework, agents are modeled to be individually ...
Manh Tung Pham, Kiam Tian Seow
EDBT
2008
ACM
111views Database» more  EDBT 2008»
15 years 10 months ago
Schema polynomials and applications
Conceptual complexity is emerging as a new bottleneck as data-base developers, application developers, and database administrators struggle to design and comprehend large, complex...
Kenneth A. Ross, Julia Stoyanovich
REX
1991
15 years 1 months ago
From Timed to Hybrid Systems
We propose a framework for the formal speci cation and veri cation of timed and hybrid systems. For timed systems we propose a speci cation language that refers to time only throug...
Oded Maler, Zohar Manna, Amir Pnueli