Pascal and Francis Bibliographic Databases

Help

Search results

Your search

ti.\*:("VMCAI 2005 : verification, model checking, and abstract interpretation (Paris, 17-19 January 2005)")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 29

  • Page / 2
Export

Selection :

  • and

Shape analysis by predicate abstractionBALABAN, Ittai; PNUELI, Amir; ZUCK, Lenore D et al.Lecture notes in computer science. 2005, pp 164-180, issn 0302-9743, isbn 3-540-24297-X, 17 p.Conference Paper

Termination of polynomial programsBRADLEY, Aaron R; MANNA, Zohar; SIPMA, Henny B et al.Lecture notes in computer science. 2005, pp 113-129, issn 0302-9743, isbn 3-540-24297-X, 17 p.Conference Paper

VMCAI 2005 : verification, model checking, and abstract interpretation (Paris, 17-19 January 2005)Cousot, Radhia.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-24297-X, XI, 481 p, isbn 3-540-24297-XConference Proceedings

Checking Herbrand equalities and beyondMÜLLER-OLM, Markus; RÜFTHING, Oliver; SEIDL, Helmut et al.Lecture notes in computer science. 2005, pp 79-96, issn 0302-9743, isbn 3-540-24297-X, 18 p.Conference Paper

On the complexity of error explanationKUMAR, Nirman; KUMAR, Viraj; VISWANATHAN, Mahesh et al.Lecture notes in computer science. 2005, pp 448-464, issn 0302-9743, isbn 3-540-24297-X, 17 p.Conference Paper

Automata as abstractionsDAMS, Dennis; NAMJOSHI, Kedar S.Lecture notes in computer science. 2005, pp 216-232, issn 0302-9743, isbn 3-540-24297-X, 17 p.Conference Paper

Don't know in the μ-calculusGRUMBERG, Orna; LANGE, Martin; LEUCKER, Martin et al.Lecture notes in computer science. 2005, pp 233-249, issn 0302-9743, isbn 3-540-24297-X, 17 p.Conference Paper

Cryptographic protocol analysis on real C codeGOUBAULT-LARRECQ, Jean; PARRENNES, Fabrice.Lecture notes in computer science. 2005, pp 363-379, issn 0302-9743, isbn 3-540-24297-X, 17 p.Conference Paper

Minimizing counterexample with unit core extraction and incremental SATSHENGYU SHEN; YING QIN; SIKUN LI et al.Lecture notes in computer science. 2005, pp 298-312, issn 0302-9743, isbn 3-540-24297-X, 15 p.Conference Paper

Simple is better: Efficient bounded model checking for past LTLLATVALA, Timo; BIERE, Armin; HELJANKO, Keijo et al.Lecture notes in computer science. 2005, pp 380-395, issn 0302-9743, isbn 3-540-24297-X, 16 p.Conference Paper

Abstract interpretation with alien expressions and heap structuresEVAN CHANG, Bor-Yuh; LEINO, K. Rustan M.Lecture notes in computer science. 2005, pp 147-163, issn 0302-9743, isbn 3-540-24297-X, 17 p.Conference Paper

Model checking of systems employing commutative functionsPRASAD SISTLA, A; MIN ZHOU; XIAODONG WANG et al.Lecture notes in computer science. 2005, pp 250-266, issn 0302-9743, isbn 3-540-24297-X, 17 p.Conference Paper

Information flow analysis for Java bytecodeGENAIM, Samir; SPOTO, Fausto.Lecture notes in computer science. 2005, pp 346-362, issn 0302-9743, isbn 3-540-24297-X, 17 p.Conference Paper

The arithmetic-geometric progression abstract domainFERET, Jérome.Lecture notes in computer science. 2005, pp 42-58, issn 0302-9743, isbn 3-540-24297-X, 17 p.Conference Paper

Efficient verification of halting properties for MPI programs with wildcard receivesSIEGEL, Stephen F.Lecture notes in computer science. 2005, pp 413-429, issn 0302-9743, isbn 3-540-24297-X, 17 p.Conference Paper

Generalized lypestate checking for data structure consistencyLAM, Patrick; KUNCAK, Viktor; RINARD, Martin et al.Lecture notes in computer science. 2005, pp 430-447, issn 0302-9743, isbn 3-540-24297-X, 18 p.Conference Paper

An overview of semantics for the validation of numerical programsMARTEL, Matthieu.Lecture notes in computer science. 2005, pp 59-77, issn 0302-9743, isbn 3-540-24297-X, 19 p.Conference Paper

Optimizing bounded model checking for linear hybrid systemsABRAHAM, Erika; BECKER, Bernd; KLAEDTKE, Felix et al.Lecture notes in computer science. 2005, pp 396-412, issn 0302-9743, isbn 3-540-24297-X, 17 p.Conference Paper

Efficiently verifiable conditions for deadlock-freedom of large concurrent programsATTIE, Paul C; CHOCKLER, Hana.Lecture notes in computer science. 2005, pp 465-481, issn 0302-9743, isbn 3-540-24297-X, 17 p.Conference Paper

Purity and side effect analysis for Java ProgramsSALCIANU, Alexandru; RINARD, Martin.Lecture notes in computer science. 2005, pp 199-215, issn 0302-9743, isbn 3-540-24297-X, 17 p.Conference Paper

Verification of an error correcting code by abstract interpretationHYMANS, Charles.Lecture notes in computer science. 2005, pp 330-345, issn 0302-9743, isbn 3-540-24297-X, 16 p.Conference Paper

I/O efficient directed model checkingJABBAR, Shahid; EDELKAMP, Stefan.Lecture notes in computer science. 2005, pp 313-329, issn 0302-9743, isbn 3-540-24297-X, 17 p.Conference Paper

Predicate abstraction and canonical abstraction for singly-linked listsMANEVICH, Roman; YAHAV, E; RAMALINGAM, G et al.Lecture notes in computer science. 2005, pp 181-198, issn 0302-9743, isbn 3-540-24297-X, 18 p.Conference Paper

Scalable analysis of linear systems using mathematical programmingSANKARANARAYANAN, Sriram; SIPMA, Henny B; MANNA, Zohar et al.Lecture notes in computer science. 2005, pp 25-41, issn 0302-9743, isbn 3-540-24297-X, 17 p.Conference Paper

Weak automata for the linear time μ-calculusLANGE, Martin.Lecture notes in computer science. 2005, pp 267-281, issn 0302-9743, isbn 3-540-24297-X, 15 p.Conference Paper

  • Page / 2