Sciweavers

564 search results - page 41 / 113
» Some Results on the Expressive Power and Complexity of LSCs
Sort
View
LFCS
2007
Springer
15 years 4 months ago
A Decidable Temporal Logic of Repeating Values
Various logical formalisms with the freeze quantifier have been recently considered to model computer systems even though this is a powerful mechanism that often leads to undecida...
Stéphane Demri, Deepak D'Souza, Régi...
IMC
2006
ACM
15 years 3 months ago
binpac: a yacc for writing application protocol parsers
A key step in the semantic analysis of network traffic is to parse the traffic stream according to the high-level protocols it contains. This process transforms raw bytes into s...
Ruoming Pang, Vern Paxson, Robin Sommer, Larry L. ...
DSS
2002
231views more  DSS 2002»
14 years 9 months ago
Computational aspects of the FLBC framework
Recent research has sought to develop formal languages for business communication as more expressive, flexible and powerful alternatives to current electronic data interchange (ED...
Aspassia Daskalopulu, Marek J. Sergot
ICIP
2003
IEEE
15 years 11 months ago
Multitemporal geospatial query grouping using correlation signatures
With recent advances in temporal and spatiotemporal databases, user demands are becoming more complex. As a result, simple queries are replaced by complex multitemporal query scen...
Giorgos Mountrakis, Peggy Agouris, Anthony Stefani...
CSL
2008
Springer
14 years 11 months ago
On the Almighty Wand
We investigate decidability, complexity and expressive power issues for (first-order) separation logic with one record field (herein called SL) and its fragments. SL can specify pr...
Rémi Brochenin, Stéphane Demri, &Eac...