498 search results - page 60 / 100 » From Language to Time: A Temporal Expression Anchorer |
LMCS
2007
14 years 11 months ago
2007
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
122
click to vote
BMCBI
2007
14 years 11 months ago
2007
Background: This work explores the quantitative characteristics of the local transcriptional regulatory network based on the availability of time dependent gene expression data se...
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Abstract The class of ω-regular languages provide a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We present two novel approaches to parsing context-free languages. The first approach is based on an extension of Brzozowski’s derivative from regular expressions to c...
123
click to vote
MTV
2006
IEEE
15 years 5 months ago
2006
IEEE
Simulation-based validation of the current industrial processors typically use huge number of test programs generated at instruction set architecture (ISA) level. However, archite...