메뉴 건너뛰기




Volumn 4144 LNCS, Issue , 2006, Pages 63-66

FAST extended release

Author keywords

Acceleration; Automata with cache computation; Counter systems verification; Generic Presburger interface

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTATION THEORY; PROBLEM SOLVING;

EID: 33749860386     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11817963_9     Document Type: Conference Paper
Times cited : (37)

References (11)
  • 1
    • 53149120129 scopus 로고    scopus 로고
    • Faster acceleration of counter automata
    • TACAS'2004. Springer
    • S. Bardin, A. Finkel, and J. Leroux. Faster acceleration of counter automata. In TACAS'2004. LNCS 2988. Springer, 2004.
    • (2004) LNCS , vol.2988
    • Bardin, S.1    Finkel, A.2    Leroux, J.3
  • 2
    • 35248857942 scopus 로고    scopus 로고
    • FAST: Fast Acceleration of Symbolic Transition systems
    • CAV'2003. Springer
    • S. Bardin, A. Finkel, J. Leroux, and L. Petrucci. FAST: Fast Acceleration of Symbolic Transition systems. In CAV'2003. LNCS 2725. Springer, 2003.
    • (2003) LNCS , vol.2725
    • Bardin, S.1    Finkel, A.2    Leroux, J.3    Petrucci, L.4
  • 3
    • 33646182258 scopus 로고    scopus 로고
    • Flat acceleration in symbolic model checking
    • ATVA'2005. Springer
    • S. Bardin, A. Finkel, J. Leroux, and P. Schnoebelen. Flat acceleration in symbolic model checking. In ATVA'2005. LNCS 3707. Springer, 2005.
    • (2005) LNCS , vol.3707
    • Bardin, S.1    Finkel, A.2    Leroux, J.3    Schnoebelen, P.4
  • 5
    • 84941165423 scopus 로고    scopus 로고
    • FAST verification of the class of stop-and-wait protocols modelled by coloured Petri nets
    • To appear
    • J. Billington, G. E. Gallasch, and L. Petrucci. FAST verification of the class of stop-and-wait protocols modelled by coloured Petri nets. Nordic Journal of Computing. To appear.
    • Nordic Journal of Computing
    • Billington, J.1    Gallasch, G.E.2    Petrucci, L.3
  • 6
    • 23944503396 scopus 로고    scopus 로고
    • A bdd-like implementation of an automata package
    • CIAA '2004. Springer
    • J.-M. Couvreur. A bdd-like implementation of an automata package. In CIAA '2004. LNCS 3317. Springer, 2004.
    • (2004) LNCS , vol.3317
    • Couvreur, J.-M.1
  • 7
    • 84877782255 scopus 로고    scopus 로고
    • How to compose Presburger-accelerations: Applications to broadcast protocols
    • FST&TCS'2002. Springer
    • A. Finkel and J. Leroux. How to compose Presburger-accelerations: Applications to broadcast protocols. In FST&TCS'2002. LNCS 2556. Springer, 2002.
    • (2002) LNCS , vol.2556
    • Finkel, A.1    Leroux, J.2
  • 8
    • 33646167672 scopus 로고    scopus 로고
    • Flat counter automata almost everywhere!
    • ATVA '2005. Springer
    • J. Leroux and G. Sutre. Flat counter automata almost everywhere! In ATVA '2005. LNCS 3707. Springer, 2005.
    • (2005) LNCS , vol.3707
    • Leroux, J.1    Sutre, G.2
  • 9
    • 84941165759 scopus 로고    scopus 로고
    • LASH homepage. http://www.montefiore.ulg.ac.be/~boigelot/research/lash/
    • LASH Homepage
  • 10
    • 84941151318 scopus 로고    scopus 로고
    • MONA homepage. http://www.brics.dk/mona/index.html
    • MONA Homepage
  • 11
    • 33645590620 scopus 로고    scopus 로고
    • OMEGA homepage. http://www.cs.umd.edu/projects/omega/
    • OMEGA Homepage


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.