Sciweavers

1052 search results - page 78 / 211
» The Regular Real-Time Languages
Sort
View
93
Voted
CALCO
2005
Springer
85views Mathematics» more  CALCO 2005»
15 years 9 months ago
Using Proofs by Coinduction to Find "Traditional" Proofs
In the specific situation of formal reasoning concerned with “regular expression equivalence” we address instances of more general questions such as: how can coinductive argum...
Clemens Grabmayer
120
Voted
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
15 years 7 months ago
Efficient Automata-Based Assertion-Checker Synthesis of SEREs for Hardware Emulation
In this paper, we present a method for generating checker circuits from sequential-extended regular expressions (SEREs). Such sequences form the core of increasingly-used Assertion...
Marc Boule, Zeljko Zilic
132
Voted
CORR
2010
Springer
107views Education» more  CORR 2010»
15 years 2 months ago
Yacc is dead
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...
Matthew Might, David Darais
132
Voted
CORR
2010
Springer
132views Education» more  CORR 2010»
15 years 3 months ago
Small NFAs from Regular Expressions: Some Experimental Results
Regular expressions (REs), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recogni...
Hugo Gouveia, Nelma Moreira, Rogério Reis
118
Voted
FDL
2007
IEEE
15 years 10 months ago
Modeling of immediate vs. delayed data communications: from AADL to UML Marte
The forthcoming OMG UML Profile for Modeling and Analysis of Real-Time Embedded systems (MARTE) aims, amongst other things, at providing a referential Time Model subprofile wher...
Frédéric Mallet, Charles André...