Execution monitoring enforcement under memory-limitation constraints

Authors:
Chamseddine Talhi;Nadia Tawbi;Mourad Debbabi
Affiliations:
LSFM Group, Computer Science Department, Laval University, Quebec, QC, Canada and Computer Security Laboratory, Concordia Institute for Information Systems Engineering, Concordia University, Montr ...;LSFM Group, Computer Science Department, Laval University, Quebec, QC, Canada;Computer Security Laboratory, Concordia Institute for Information Systems Engineering, Concordia University, Montréal, QC, Canada
Venue:
Information and Computation
Year:
2008

Citing 16
Cited 15

A note on denial-of-service in operating systems

IEEE Transactions on Software Engineering
Languages and scanners

Theoretical Computer Science
A Polynomial time Algorithm for the Local Testability Problem of Deterministic Finite Automata

IEEE Transactions on Computers
Computing the Order of a Locally Testable Automaton

SIAM Journal on Computing
History-based access control for mobile code

CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Families of locally testable languages

Theoretical Computer Science
Enforceable security policies

ACM Transactions on Information and System Security (TISSEC)
Stack inspection: theory and variants

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata

WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Foundations for the run-time analysis of software systems

Foundations for the run-time analysis of software systems
Composing security policies with polymer

Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation
Computability classes for enforcement mechanisms

ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving the Correctness of Multiprocess Programs

IEEE Transactions on Software Engineering
A polynomial time algorithm for left [right] local testability

CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
On locally checkable properties

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Enforcing non-safety security policies with program monitors

ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security

Security-By-Contract for the Future Internet

Future Internet --- FIS 2008
Efficient IRM enforcement of history-based access control policies

Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
Do You Really Mean What You Actually Enforced?

Formal Aspects in Security and Trust
Security Policies Enforcement Using Finite Edit Automata

Electronic Notes in Theoretical Computer Science (ENTCS)
Towards Practical Enforcement Theories

NordSec '09 Proceedings of the 14th Nordic Conference on Secure IT Systems: Identity and Privacy in the Internet Age
Generating In-Line Monitors for Rabin Automata

NordSec '09 Proceedings of the 14th Nordic Conference on Secure IT Systems: Identity and Privacy in the Internet Age
Using equivalence relations for corrective enforcement of security policies

MMM-ACNS'10 Proceedings of the 5th international conference on Mathematical methods, models and architectures for computer network security
A theory of runtime enforcement, with results

ESORICS'10 Proceedings of the 15th European conference on Research in computer security
Predictability of enforcement

ESSoS'11 Proceedings of the Third international conference on Engineering secure software and systems
Corrective enforcement of security policies

FAST'10 Proceedings of the 7th International conference on Formal aspects of security and trust
Relationship-based access control policies and their policy languages

Proceedings of the 16th ACM symposium on Access control models and technologies
Corrective Enforcement: A New Paradigm of Security Policy Enforcement by Monitors

ACM Transactions on Information and System Security (TISSEC)
A quantitative approach for inexact enforcement of security policies

ISC'12 Proceedings of the 15th international conference on Information Security
Enforceable Security Policies Revisited

ACM Transactions on Information and System Security (TISSEC)
Iterative enforcement by suppression: Towards practical enforcement theories

Journal of Computer Security - ARSPA-WITS'10

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, attention has been given to formally characterize security policies that are enforceable by different kinds of security mechanisms. A very important research problem is the characterization of security policies that are enforceable by execution monitors constrained by memory limitations. This paper contributes to give more precise answers to this research problem. To represent execution monitors constrained by memory limitations, we introduce a new class of automata, bounded history automata. Characterizing memory limitations leads us to define a precise taxonomy of security policies that are enforceable under memory-limitation constraints.