( en | de | ru )

 

Disambiguation of "Pietro, Pierluigi San"

Author of the publication

copydeleteadd this publication to your clipboard
Associative definition of programming languages.

, , and . Comput. Lang., 26 (2-4): 105-123 (2000)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

San San Lin

San San Hmwe

Pierluigi Casale

Pierluigi Ramadori

Pierluigi Migliano

 

Other publications of authors with the same name

Dense Counter Machines and Verification Problems., , , and . CAV, volume 2725 of Lecture Notes in Computer Science, page 93-105. Springer, (2003)An Object-Oriented Logic Language for Modular System Specification., and . ECOOP, volume 512 of Lecture Notes in Computer Science, page 39-58. Springer, (1991)Some Structural Properties of Associative Language Descriptions., , and . ICTCS, volume 2202 of Lecture Notes in Computer Science, page 172-183. Springer, (2001)Automatic Verification of Multi-queue Discrete Timed Automata., and . COCOON, volume 2697 of Lecture Notes in Computer Science, page 159-171. Springer, (2003)Dealing with different time scales in formal specifications., , , , , , and . IWSSD, page 92-101. IEEE Computer Society, (1991)Row-Column Combination of Dyck Words., , and . SOFSEM, volume 14519 of Lecture Notes in Computer Science, page 139-153. Springer, (2024)Bounded Reachability for Temporal Logic over Constraint Systems., , , , , and . TIME, page 43-50. IEEE Computer Society, (2010)Extracting Coarse-Grained Parallelism in Program Loops with the Slicing Framework., , and . ISPDC, page 203-210. IEEE Computer Society, (2007)Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter., , and . FSTTCS, volume 2245 of Lecture Notes in Computer Science, page 132-143. Springer, (2001)Finding Synchronization-Free Parallelism Represented with Trees of Dependent Operations., , , and . ICA3PP, volume 5022 of Lecture Notes in Computer Science, page 185-195. Springer, (2008)