( en | de | ru )

 

Disambiguation of "Francesco, Nicoletta De"

Author of the publication

copydeleteadd this publication to your clipboard
Towards a Logical Semantics for Pure Prolog.

, , , and . Sci. Comput. Program., 32 (1-3): 145-176 (1998)

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.

Francesco De Gasperin

Francesco de Gasperin

Francesco De Meo

Nicoletta Kiefer

Nicoletta Grillo

 

Other publications of authors with the same name

Reduced Models for Efficient CCS Verification., , , and . Formal Methods Syst. Des., 26 (3): 319-350 (2005)Fixing the Java bytecode verifier by a suitable type domain., , , and . SEKE, page 377-382. ACM, (2002)Efficient Bytecode Verification Using Immediate Postdominators in Control Flow Graphs: Extended Abstract., , and . OTM Workshops, volume 2889 of Lecture Notes in Computer Science, page 425-436. Springer, (2003)Combining Abstract Interpretation and Model Checking for Analysing Security Properties of Java Bytecode., and . VMCAI, volume 2294 of Lecture Notes in Computer Science, page 1-15. Springer, (2002)Abstract Interpretation and Model Checking for Checking Secure Information Flow in Concurrent Systems., , and . Fundam. Informaticae, 54 (2-3): 195-211 (2003)An Interactive Debugger for a Concurrent Language., , and . ICSE, page 320-329. IEEE Computer Society, (1985)Specification of Concurrency Control in Persistent Programming Languages., , , and . POS, page 126-143. Springer, (1992)Proving Finiteness of CCS Processes by Non-Standard Semantics., and . Acta Inf., 31 (1): 55-80 (1994)Analyzing Information Flow Properties in Assembly Code by Abstract Interpretation., , and . Comput. J., 47 (1): 25-45 (2004)Finite Approximations for Model Checking Non-finite-state Processes., , , and . Comput. J., 44 (2): 109-123 (2001)