Sciweavers

3653 search results - page 131 / 731
» On Recognizable Timed Languages
Sort
View
ICFEM
2003
Springer
15 years 3 months ago
Formal Proof of a Polychronous Protocol for Loosely Time-Triggered Architectures
The verification of safety critical systems has become an area of increasing importance in computer science. The notion of reactive system has emerged to concentrate on problems r...
Mickaël Kerboeuf, David Nowak, Jean-Pierre Ta...
EDBT
1998
ACM
105views Database» more  EDBT 1998»
15 years 2 months ago
Equal Time for Data on the Internet with WebSemantics
Many collections of scienti c data in particular disciplines are available today around the world. Much of this data conforms to some agreed upon standard for data exchange, i.e., ...
George A. Mihaila, Louiqa Raschid, Anthony Tomasic
ESOP
2000
Springer
15 years 1 months ago
A Calculus for Link-Time Compilation
We present a module calculus for studying a simple model of link-time compilation. The calculus is stratified into a term calculus, a core module calculus, and a linking calculus. ...
Elena Machkasova, Franklyn A. Turbak
CIKM
2008
Springer
15 years 1 days ago
Linear time membership in a class of regular expressions with interleaving and counting
The extension of Regular Expressions (REs) with an interleaving (shuffle) operator has been proposed in many occasions, since it would be crucial to deal with unordered data. Howe...
Giorgio Ghelli, Dario Colazzo, Carlo Sartiani
ECOOP
2008
Springer
14 years 12 months ago
Practical Object-Oriented Back-in-Time Debugging
Back-in-time debuggers are extremely useful tools for identifying the causes of bugs. Unfortunately the "omniscient" approaches that try to remember all previous states a...
Adrian Lienhard, Tudor Gîrba, Oscar Nierstra...