共 50 条
- [21] SEMANTICS FOR LOGIC PROGRAMS WITHOUT OCCUR CHECK [J]. THEORETICAL COMPUTER SCIENCE, 1990, 71 (01) : 155 - 174
- [22] FULLY ABSTRACT COMPOSITIONAL SEMANTICS FOR LOGIC PROGRAMS [J]. CONFERENCE RECORD OF THE SIXTEENTH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES, 1989, : 134 - 142
- [23] A Sound Analysis for Secure Information Flow Using Abstract Memory Graphs [J]. FUNDAMENTALS OF SOFTWARE ENGINEERING, 2010, 5961 : 355 - +
- [25] Generalized abstract non-interference: Abstract secure information-flow analysis for automata [J]. COMPUTER NETWORK SECURITY, PROCEEDINGS, 2005, 3685 : 221 - 234
- [26] A fully abstract may testing semantics for concurrent objects [J]. 17TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2002, : 101 - 112
- [27] Backwards-directed information flow analysis for concurrent programs [J]. 2021 IEEE 34TH COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSF 2021), 2021, : 33 - 48
- [28] Phase semantics and verification of concurrent constraint programs [J]. THIRTEENTH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 1998, : 141 - 152
- [30] Verifying Optimizations of Concurrent Programs in the Promising Semantics [J]. PROCEEDINGS OF THE 43RD ACM SIGPLAN INTERNATIONAL CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION (PLDI '22), 2022, : 903 - 917