Full Functional Verification of Linked Data Structures
- Author
- ZEE, Karen1 ; KUNCAK, Viktor2 ; RINARD, Martin C1
[1] MIT CSAIL, Cambridge, MA, United States
[2] EPFL. I&C, Lausanne, Switzerland - Conference title
- Proceedings of the 2008 ACM SIGPLAN Conference on Programming Languages Design Implementation (PLDI 2008)
- Conference name
- 2008 SIGPLAN Conference on Programming Language Design & Implementation (Tucson, Arizona 2008-06-07)
- Author (monograph)
- ACE, United States (Organiser of meeting)
AMD, United States (Organiser of meeting)
Google, United States (Organiser of meeting)
IBM Research, United States (Organiser of meeting)
Intel, United States (Organiser of meeting)
Microsoft Research, United States (Organiser of meeting) - Source
ACM SIGPLAN notices. 2008, Vol 43, Num 6, pp 349-361, 13 p ; ref : 89 ref
- ISSN
- 1523-2867
- Scientific domain
- Computer science
- Publisher
- Association for Computing Machinery, New York, NY
- Publication country
- United States
- Document type
- Conference Paper
- Language
- English
- Author keyword
- Algorithms Java Languages Reliability Verification data structure decision procedure theorem prover verification
- Keyword (fr)
- Abstraction Chaînage donnée Démonstration théorème Fermeture transitive Fiabilité Gestion mémoire Hachage Hypertexte Langage JAVA Langage programmation Logique ordre supérieur Méthode cas pire Prise de décision Quantificateur Spécification formelle Structure donnée Système expert Temps exécution Théorie preuve
- Keyword (en)
- Abstraction Data link Theorem proving Transitive closure Reliability Storage management Hashing Hypertext JAVA language Programming language High order logic Worst case method Decision making Quantifier Formal specification Data structure Expert system Execution time Proof theory
- Keyword (es)
- Abstracción Ligazón datos Demostración teorema Cerradura transitiva Fiabilidad Gestión memoria Hashing Hipertexto Lenguaje JAVA Lenguaje programación Lógica orden superior Método caso peor Toma decision Cuantificador Especificación formal Estructura datos Sistema experto Tiempo ejecución Teoría demonstración
- Classification
- Pascal
- 001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02A Mathematical logic, foundations, set theory / 001A02A01 Logic and foundations / 001A02A01F Proof theory and constructive mathematics
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B02 Programming languages
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B07 Memory organisation. Data processing / 001D02B07C Memory and file management (including protection and security)
- Discipline
- Computer science : theoretical automation and systems Mathematics
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 20606513
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1145/1379022.1375624 
https://dx.doi.org/10.1145/1379022.1375624
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:23:\"10.1145\/1379022.1375624\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:54:\"Full Functional Verification of Linked Data Structures\";s:9:\"\u0000*\u0000jtitle\";s:19:\"ACM SIGPLAN notices\";s:9:\"\u0000*\u0000stitle\";s:15:\"ACM SIGPLAN not\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"43\";s:8:\"\u0000*\u0000issue\";s:1:\"6\";s:8:\"\u0000*\u0000spage\";s:3:\"349\";s:8:\"\u0000*\u0000epage\";s:3:\"361\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1523-2867\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"ZEE\";s:10:\"\u0000*\u0000aufirst\";s:5:\"Karen\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:14:\"KUNCAK, Viktor\";i:1;s:16:\"RINARD, Martin C\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:105:\"Proceedings of the 2008 ACM SIGPLAN Conference on Programming Languages Design Implementation (PLDI 2008)\";s:8:\"\u0000*\u0000title\";s:54:\"Full Functional Verification of Linked Data Structures\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:35:\"Association for Computing Machinery\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"13\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:23:\"10.1145\/1379022.1375624\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:54:\"Full Functional Verification of Linked Data Structures\";s:9:\"\u0000*\u0000jtitle\";s:19:\"ACM SIGPLAN notices\";s:9:\"\u0000*\u0000stitle\";s:15:\"ACM SIGPLAN not\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"43\";s:8:\"\u0000*\u0000issue\";s:1:\"6\";s:8:\"\u0000*\u0000spage\";s:3:\"349\";s:8:\"\u0000*\u0000epage\";s:3:\"361\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1523-2867\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"ZEE\";s:10:\"\u0000*\u0000aufirst\";s:5:\"Karen\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:14:\"KUNCAK, Viktor\";i:1;s:16:\"RINARD, Martin C\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:105:\"Proceedings of the 2008 ACM SIGPLAN Conference on Programming Languages Design Implementation (PLDI 2008)\";s:8:\"\u0000*\u0000title\";s:54:\"Full Functional Verification of Linked Data Structures\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:35:\"Association for Computing Machinery\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"13\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:23:\"10.1145\/1379022.1375624\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:23:\"10.1145\/1379022.1375624\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:54:\"Full Functional Verification of Linked Data Structures\";s:9:\"\u0000*\u0000jtitle\";s:19:\"ACM SIGPLAN notices\";s:9:\"\u0000*\u0000stitle\";s:15:\"ACM SIGPLAN not\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"43\";s:8:\"\u0000*\u0000issue\";s:1:\"6\";s:8:\"\u0000*\u0000spage\";s:3:\"349\";s:8:\"\u0000*\u0000epage\";s:3:\"361\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1523-2867\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"ZEE\";s:10:\"\u0000*\u0000aufirst\";s:5:\"Karen\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:14:\"KUNCAK, Viktor\";i:1;s:16:\"RINARD, Martin C\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:105:\"Proceedings of the 2008 ACM SIGPLAN Conference on Programming Languages Design Implementation (PLDI 2008)\";s:8:\"\u0000*\u0000title\";s:54:\"Full Functional Verification of Linked Data Structures\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:35:\"Association for Computing Machinery\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"13\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:23:\"10.1145\/1379022.1375624\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:54:\"Full Functional Verification of Linked Data Structures\";s:9:\"\u0000*\u0000jtitle\";s:19:\"ACM SIGPLAN notices\";s:9:\"\u0000*\u0000stitle\";s:15:\"ACM SIGPLAN not\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"43\";s:8:\"\u0000*\u0000issue\";s:1:\"6\";s:8:\"\u0000*\u0000spage\";s:3:\"349\";s:8:\"\u0000*\u0000epage\";s:3:\"361\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1523-2867\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"ZEE\";s:10:\"\u0000*\u0000aufirst\";s:5:\"Karen\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:14:\"KUNCAK, Viktor\";i:1;s:16:\"RINARD, Martin C\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:105:\"Proceedings of the 2008 ACM SIGPLAN Conference on Programming Languages Design Implementation (PLDI 2008)\";s:8:\"\u0000*\u0000title\";s:54:\"Full Functional Verification of Linked Data Structures\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:35:\"Association for Computing Machinery\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"13\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:23:\"10.1145\/1379022.1375624\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:54:\"Full Functional Verification of Linked Data Structures\";s:9:\"\u0000*\u0000jtitle\";s:19:\"ACM SIGPLAN notices\";s:9:\"\u0000*\u0000stitle\";s:15:\"ACM SIGPLAN not\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"43\";s:8:\"\u0000*\u0000issue\";s:1:\"6\";s:8:\"\u0000*\u0000spage\";s:3:\"349\";s:8:\"\u0000*\u0000epage\";s:3:\"361\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1523-2867\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"ZEE\";s:10:\"\u0000*\u0000aufirst\";s:5:\"Karen\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:14:\"KUNCAK, Viktor\";i:1;s:16:\"RINARD, Martin C\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:105:\"Proceedings of the 2008 ACM SIGPLAN Conference on Programming Languages Design Implementation (PLDI 2008)\";s:8:\"\u0000*\u0000title\";s:54:\"Full Functional Verification of Linked Data Structures\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:35:\"Association for Computing Machinery\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"13\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
