Bases de datos bibliográficos Pascal y Francis

Ayuda

Enlace permanente
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19110797

Proving thread termination

Autor
COOK, Byron1 ; PODELSKI, Andreas2 ; RYBALCHENKO, Andrey3
[1] Microsoft Research, United States
[2] University of Freiburg, Germany
[3] EPFL and MPI, Germany
Titulo de la conferencia
PLDI'07 Proceedings of the 2007 ACM SIGPLAN Conference on Programming Language Design & Implementation, June 10-13, 2007, San Diego, CA
Nombre de la conferencia
PLDI 2007 Conference on Programming Language Design & Implementation (San Diego, CA 2007-06-10)
Autor ( monografía)
Association for Computing Machinery (ACM), Special Interest Group on Programming Languages (SIGPLAN), New York, NY, United States (Organiser of meeting)
Association for Computing Machinery (ACM), Special Interest Group on Software Engineering (SIGSOFT), New York, NY, United States (Organiser of meeting)
Fuente

ACM SIGPLAN notices. 2007, Vol 42, Num 6, pp 320-330, 11 p ; ref : 40 ref

ISSN
1523-2867
Campo Científico
Computer science
Editor
ACM, Broadway, NY
País de la publicación
United States
Tipo de documento
Conference Paper
Idioma
English
Palabra clave de autor
Concurrency Formal verification Model checking Program verification Reliability Termination Threads Verification
Palabra clave (fr)
Abstraction Courriel Extensibilité Fiabilité Ingénierie simultanée Interprétation abstraite Langage programmation Pilote périphérique Problème terminaison Programmation automatique Programme concurrent Serveur informatique Simultanéité informatique Système exploitation Théorie preuve Vérification formelle Vérification modèle Vérification programme
Palabra clave (in)
Abstraction Electronic mail Scalability Reliability Concurrent engineering Abstract interpretation Programming language Device driver Termination problem Automatic programming Concurrent program Computer server Concurrency Operating system Proof theory Formal verification Model checking Program verification
Palabra clave (es)
Abstracción Correo electrónico Estensibilidad Fiabilidad Ingeniería simultánea Interpretación Abstracta Lenguaje programación Piloto periférico Problema terminación Programación automática Programa competidor Servidor informático Simultaneidad informatica Sistema operativo Teoría demonstración Verificación modelo Verificación programa
Clasificación
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 / 001D02B04 Computer systems and distributed systems. User interface

Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B09 Software engineering

Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B11 Computer aided design

Disciplina
Computer science : theoretical automation and systems
Procedencia
Inist-CNRS
Base de datos
PASCAL
Identificador INIST
19110797

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

Acceso al documento

Buscar en la web