×

Found 13 Documents (Results 1–13)

Analyzing asynchronous programs with preemption. (English) Zbl 1248.68348

Hariharan, Ramesh (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2008), December 9–11, 2008, Bangalore, India. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-08-8). LIPIcs – Leibniz International Proceedings in Informatics 2, 37-48, electronic only (2008).
MSC:  68Q85 68Q60
PDFBibTeX XMLCite
Full Text: DOI Link

Antichain-based universality and inclusion testing over nondeterministic finite tree automata. (English) Zbl 1172.68493

Ibarra, Oscar H. (ed.) et al., Implementation and applications of automata. 13th international conference, CIAA 2008, San Francisco, California, USA, July 21–24, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-70843-8/pbk). Lecture Notes in Computer Science 5148, 57-67 (2008).
MSC:  68Q45 68P05
PDFBibTeX XMLCite
Full Text: DOI

On the reachability analysis of acyclic networks of pushdown systems. (English) Zbl 1160.68451

van Breugel, Franck (ed.) et al., CONCUR 2008 – concurrency theory. 19th international conference, CONCUR 2008, Toronto, Canada, August 19–22, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85360-2/pbk). Lecture Notes in Computer Science 5201, 356-371 (2008).
MSC:  68Q85 68Q60
PDFBibTeX XMLCite
Full Text: DOI

On symbolic verification of weakly extended PAD. (English) Zbl 1277.68133

Amadio, Roberto (ed.) et al., Proceedings of the 13th international workshop on expressiveness in concurrency (EXPRESS 2006), Bonn, Germany, August 26, 2006. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 175, No. 3, 47-64 (2007).
PDFBibTeX XMLCite
Full Text: DOI

Reachability analysis of synchronized PA systems. (English) Zbl 1272.68290

Bradfield, Julian (ed.) et al., Proceedings of the 6th international workshop on verification of infinite-state systems (INFINITY 2004), London, UK, September 4, 2004. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 138, No. 3, 153-178 (2005).
MSC:  68Q85 68Q60
PDFBibTeX XMLCite
Full Text: Link

Regular symbolic analysis of dynamic networks of pushdown systems. (English) Zbl 1134.68427

Abadi, Martín (ed.) et al., CONCUR 2005 – concurrency theory. 16th international conference, CONCUR 2005, San Francisco, CA, USA, August 23–26, 2005. Proceedings. Berlin: Springer (ISBN 3-540-28309-9/pbk). Lecture Notes in Computer Science 3653, 473-487 (2005).
MSC:  68Q85 68Q45
PDFBibTeX XMLCite
Full Text: DOI

On computing reachability sets of process rewrite systems. (English) Zbl 1078.68652

Giesl, Jürgen (ed.), Term rewriting and applications. 16th international conference, RTA 2005, Nara, Japan, April 19–21, 2005. Proceedings. Berlin: Springer (ISBN 3-540-25596-6/pbk). Lecture Notes in Computer Science 3467, 484-499 (2005).
MSC:  68Q42 68Q45 68Q85
PDFBibTeX XMLCite
Full Text: DOI

A generic approach to the static analysis of concurrent programs with procedures. (English) Zbl 1321.68185

Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL ’03, New Orleans, LA, USA, January 15–17, 2003. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-628-5). 62-73 (2003).
MSC:  68N30 68N19 68Q45
PDFBibTeX XMLCite
Full Text: DOI

Reachability analysis of process rewrite systems. (English) Zbl 1205.68183

Pandya, Paritosh K. (ed.) et al., FST TCS 2003: Foundations of software technology and theoretical computer science. 23rd conference, Mumbai, India, December 15–17, 2003. Proceedings. Berlin: Springer (ISBN 3-540-20680-9/pbk). Lect. Notes Comput. Sci. 2914, 74-87 (2003).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field

Software