Computer Science – Logic in Computer Science
Scientific paper
2012-04-12
Computer Science
Logic in Computer Science
Scientific paper
We present a logic for the specification of static analysis problems that goes beyond the logics traditionally used. Its most prominent feature is the direct support for both inductive computations of behaviors as well as co-inductive specifications of properties. Two main theoretical contributions are a Moore Family result and a parametrized worst case time complexity result. We show that the logic and the associated solver can be used for rapid prototyping and illustrate a wide variety of applications within Static Analysis, Constraint Satisfaction Problems and Model Checking. In all cases the complexity result specializes to the worst case time complexity of the classical methods.
Filipiuk Piotr
Nielson Flemming
Nielson Hanne Riis
No associations
LandOfFree
Layered Fixed Point Logic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Layered Fixed Point Logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Layered Fixed Point Logic will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-313025