Article

A Static Analysis of CSP Programs

Author:

Krzysztof R. AptAuthors Info & Claims

Proceedings of the Carnegie Mellon Workshop on Logic of Programs

Pages 1 - 17

Published: 06 June 1983 Publication History

Abstract

No abstract available.

Cited By

View all

Ding ZZhang KHu J(2008)A rigorous approach towards test case generationInformation Sciences: an International Journal10.1016/j.ins.2008.06.020178:21(4057-4079)Online publication date: 1-Nov-2008
https://dl.acm.org/doi/10.1016/j.ins.2008.06.020
Iyer SRamesh S(2001)ApportioningIEEE Transactions on Software Engineering10.1109/32.96534327:11(1037-1056)Online publication date: 1-Nov-2001
https://dl.acm.org/doi/10.1109/32.965343
Cheung SKramer JRombach H(1996)Checking subsystem safety properties in compositional reachability analysisProceedings of the 18th international conference on Software engineering10.5555/227726.227755(144-154)Online publication date: 1-May-1996
https://dl.acm.org/doi/10.5555/227726.227755
Show More Cited By

A Static Analysis of CSP Programs
1. Software and its engineering
  1. Software creation and management

Recommendations

PMAF: an algebraic framework for static analysis of probabilistic programs
PLDI '18

Automatically establishing that a probabilistic program satisfies some property ϕ is a challenging problem. While a sampling-based approach—which involves running the program repeatedly—can suggest that ϕ holds, to establish that the program satisfies ϕ,...
PMAF: an algebraic framework for static analysis of probabilistic programs
PLDI 2018: Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation

Automatically establishing that a probabilistic program satisfies some property ϕ is a challenging problem. While a sampling-based approach—which involves running the program repeatedly—can suggest that ϕ holds, to establish that the program satisfies ϕ,...
Software Tamper Resistance: Obstructing Static Analysis of Programs

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Proceedings of the Carnegie Mellon Workshop on Logic of Programs

June 1983

507 pages

ISBN:3540128964

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 06 June 1983

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ding ZZhang KHu J(2008)A rigorous approach towards test case generationInformation Sciences: an International Journal10.1016/j.ins.2008.06.020178:21(4057-4079)Online publication date: 1-Nov-2008
https://dl.acm.org/doi/10.1016/j.ins.2008.06.020
Iyer SRamesh S(2001)ApportioningIEEE Transactions on Software Engineering10.1109/32.96534327:11(1037-1056)Online publication date: 1-Nov-2001
https://dl.acm.org/doi/10.1109/32.965343
Cheung SKramer JRombach H(1996)Checking subsystem safety properties in compositional reachability analysisProceedings of the 18th international conference on Software engineering10.5555/227726.227755(144-154)Online publication date: 1-May-1996
https://dl.acm.org/doi/10.5555/227726.227755
Ladkin PSimons B(1994)Static analysis of multiway synchronizationProceedings of the 1994 conference of the Centre for Advanced Studies on Collaborative research10.5555/782185.782224Online publication date: 31-Oct-1994
https://dl.acm.org/doi/10.5555/782185.782224
Cheung SKramer JFadini BOsterweil Lvan Lamsweerde A(1994)An integrated method for effective behaviour analysis of distributed systemsProceedings of the 16th international conference on Software engineering10.5555/257734.257792(309-320)Online publication date: 21-May-1994
https://dl.acm.org/doi/10.5555/257734.257792
Felder MGhezzi CPezzè M(1993)Analyzing refinements of state based specificationsACM SIGSOFT Software Engineering Notes10.1145/174146.15419318:3(28-39)Online publication date: 1-Jul-1993
https://dl.acm.org/doi/10.1145/174146.154193
Felder MGhezzi CPezzè M(1993)Analyzing refinements of state based specificationsProceedings of the 1993 ACM SIGSOFT international symposium on Software testing and analysis10.1145/154183.154193(28-39)Online publication date: 1-Aug-1993
https://dl.acm.org/doi/10.1145/154183.154193
Ladkin PSimons BKennedy KPolychronopoulos C(1992)Compile-time analysis of communicating processesProceedings of the 6th international conference on Supercomputing10.1145/143369.143417(248-259)Online publication date: 1-Aug-1992
https://dl.acm.org/doi/10.1145/143369.143417
Taylor RLevine DKelly C(1992)Structural Testing of Concurrent ProgramsIEEE Transactions on Software Engineering10.1109/32.12676918:3(206-215)Online publication date: 1-Mar-1992
https://dl.acm.org/doi/10.1109/32.126769
Masticola SRyder B(1991)A model of Ada programs for static deadlock detection in polynomial timesACM SIGPLAN Notices10.1145/127695.12276826:12(97-107)Online publication date: 1-Dec-1991
https://dl.acm.org/doi/10.1145/127695.122768
Show More Cited By

Abstract

Cited By

Recommendations

PMAF: an algebraic framework for static analysis of probabilistic programs

PMAF: an algebraic framework for static analysis of probabilistic programs

Software Tamper Resistance: Obstructing Static Analysis of Programs

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations