Sciweavers

1750 search results - page 257 / 350
» Formal multiple-bernoulli models for language modeling
Sort
View
ENTCS
2006
173views more  ENTCS 2006»
15 years 6 months ago
Concurrent LSC Verification: On Decomposition Properties of Partially Ordered Symbolic Automata
Partially Ordered Symbolic Automata (POSAs) are used as the semantical foundation of visual formalisms like the scenario based language of Live Sequence Charts (LSCs). To check whe...
Tobe Toben, Bernd Westphal
PPDP
2010
Springer
15 years 3 months ago
Rewrite-based verification of XML updates
We propose a model for XML update primitives of the W3C XQuery Update Facility as parameterized rewriting rules of the form: "insert an unranked tree from a regular tree lang...
Florent Jacquemard, Michaël Rusinowitch
FM
2009
Springer
124views Formal Methods» more  FM 2009»
16 years 18 days ago
Reasoning about Memory Layouts
Verification methods for memory-manipulating C programs need to address not only well-typed programs that respect invariants such as the split heap memory model, but also programs...
Holger Gast
ATAL
2007
Springer
16 years 6 days ago
A temporal epistemic logic with a reset operation
We present an axiomatisation for an extension of a temporal epistemic logic with an epistemic “reset” operator defined on the intersection between epistemic and temporal rela...
Alessio Lomuscio, Bozena Wozna
134
Voted
CAV
2007
Springer
129views Hardware» more  CAV 2007»
16 years 6 days ago
BAT: The Bit-Level Analysis Tool
Abstract. While effective methods for bit-level verification of low-level properties exist, system-level properties that entail reasoning about a significant part of the design p...
Panagiotis Manolios, Sudarshan K. Srinivasan, Daro...